Iskanje po repozitoriju

Opis: 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 incidence graphs of finite planes are extremal egr-graphs. We also prove new lower bounds on the order of egr-graphs.
Ključne besede: edge-girth-regular graph, cage problem, finite biaffine planes
Objavljeno v RUP: 03.11.2025; Ogledov: 133; Prenosov: 1
Celotno besedilo (547,76 KB)