Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
On extremal (almost) edge-girth-regular graphs
Gabriela Araujo-Pardo, György Kiss, István Porupsánszki
Izvirni znanstveni članek
Oznake: edge-girth-regular graph;cage problem;finite biaffine planes;
A k-regular graph of girth g is called an edge-girth-regular graph, or an egr-graph for short, if each of its edges is contained in exactly λ distinct g-cycles. An egr-graph is called extremal for the triple (k, g, λ) if has the smallest possible order. We prove that some graphs arising from inciden ...
Leto: 2025 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: