Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Symmetries in graphs via simplicial automorphisms
    Kutnar, Klavdija, 1980- ; Marušič, Dragan
    An automorphism ▫$\rho$▫ of a graph ▫$X$▫ is said to be semiregular provided all of its cycles in its cycle decomposition are of the same length, and is said to be simplicial if it is semiregular and ... the quotient multigraph ▫$X_{\rho}$▫ of ▫$X$▫ with respect to ▫$\rho$▫ is a simple graph, and thus of the same valency as ▫$X$▫. It is shown that, with the exception of the complete graph ▫$K_4$▫, the Petersen graph, the Coxeter graph and the so called H-graph (alternatively denoted as ▫$S(17)$▫, the smallest graph in the family of the so called Sextet graphs ▫$S(p)$▫, ▫$p\equiv {\pm 1 \pmod {16}}$▫), every cubic arc-transitive graph with a primitive automorphism group admits a simplicial automorphism.
    Vir: Journal of combinatorial theory. Series A. - ISSN 0097-3165 (Vol. 190, art. 105639, 2022, str. 1-21)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2022
    Jezik - angleški
    COBISS.SI-ID - 108478211

    Povezava(-e):

    https://www.sciencedirect.com/science/article/pii/S0097316522000474
    https://doi.org/10.1016/j.jcta.2022.105639
    DOI

Vnos na polico