UP - logo
Univerza na Primorskem Univerzitetna knjižnica - vsi oddelki (UPUK)
  • Classification of edge-transitive Nest graphs
    Kovács, István, 1969-
    A finite simple graph Γ is called a Nest graph if it is regular of valency 6 and admits an automorphism with two orbits of the same length such that at least one of the subgraphs induced by these ... orbits is a cycle. In this paper, we complete classification of the edge-transitive Nest graphs and by this solve the problem posed by Jajcay et al. (Electron J Comb 26:#P2.6, 2019).
    Vir: Graphs and combinatorics. - ISSN 0911-0119 (Vol. 39, art. 66, 2023, str. 1-13)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2023
    Jezik - angleški
    COBISS.SI-ID - 155419139

    Povezava(-e):

    https://link.springer.com/article/10.1007/s00373-023-02659-3
    https://doi.org/10.1007/s00373-023-02659-3
    DOI

vir: Graphs and combinatorics. - ISSN 0911-0119 (Vol. 39, art. 66, 2023, str. 1-13)

loading ...
loading ...
loading ...

Vnos na polico