Skip to content
DraconiticResearch
Search Sources API
181,716 studies31 sourcesUpdated 24 min ago
PreprintarXiv licencearXiv

Additive mappings of unweighted directed graphs preserving individual values of the cycle length

  • Alexander Vlasov
  • Alexander Guterman
  • Svetlana Zhilina
Open at sourcePDFDOICite

Abstract

On the set of unweighted directed graphs on n vertices, the union of graphs is defined as the union of their arc sets. A mapping of graphs is said to be additive if it preserves the union operation. In this paper, a characterization of additive mappings of unweighted directed graphs preserving a fixed value k ≥ 3 of the cycle length is obtained.

Related

  1. Length distortion of volume-preserving Lipschitz mappings
    Damaris Meier, Kai Rajala
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  2. Balanced weightings and permutation matchings applied to the monoid of order-preserving mappings
    Peter M. Higgins
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  3. Linear transformations of tropical matrices preserving individual values of the cyclicity index
    Alexander Guterman, Alexander Vlasov, Svetlana Zhilina
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. Sharp order-preserving integer models for short additive equalities
    Enkai Zhang
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Wave Breaking and Structure-Preserving Fully Discrete Method for Stochastic Camassa--Holm Equation with Additive Noise
    Liying Sun, Zizhao Sun, Liying Zhang
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv

Cite

BibTeXRIS
BibTeX
@misc{vlasov2026additive,
  title = {{Additive mappings of unweighted directed graphs preserving individual values of the cycle length}},
  author = {Alexander Vlasov and Alexander Guterman and Svetlana Zhilina},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.00702},
  eprint = {2611.00702},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.00702},
}
RIS
TY  - UNPB
TI  - Additive mappings of unweighted directed graphs preserving individual values of the cycle length
AU  - Alexander Vlasov
AU  - Alexander Guterman
AU  - Svetlana Zhilina
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.00702
UR  - https://arxiv.org/abs/2611.00702
AB  - On the set of unweighted directed graphs on n vertices, the union of graphs is defined as the union of their arc sets. A mapping of graphs is said to be additive if it preserves the union operation. In this paper, a characterization of additive mappings of unweighted directed graphs preserving a fixed value k ≥ 3 of the cycle length is obtained.
ER  -