VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • On extremal (almost) edge-girth-regular graphs [Elektronski vir]
    Araujo-Pardo, Gabriela ; Kiss, György, matematik ; Porupsánszki, István
    A k-regular graph of girth g is called an edge-girth-regular graph, or an egr-graph forshort, if each of its edges is contained in exactly λ distinct g-cycles. An egr-graph is called extremal for the ... triple (k,g,λ) if it has the smallest possible order. We prove that somegraphs arising from incidence graphs of finite planes are extremal egr-graphs. We also prove new lower bounds on the order of egr-graphs.
    Vir: The art of discrete and applied mathematics [Elektronski vir]. - ISSN 2590-9770 (Vol. 8, no. 3, [article no.] P3.05, 2025, str. 1-21)
    Vrsta gradiva - e-članek ; neleposlovje za odrasle
    Leto - 2025
    Jezik - angleški
    COBISS.SI-ID - 237299715

    Povezava(-e):

    https://adam-journal.eu/index.php/ADAM/article/view/1733
    Digitalna knjižnica Slovenije - dLib.si
    DOI

Vnos na polico