2.
On edge-girth-regular graphs: lower bounds and new familiesIstván Porupsánszki, 2025, izvirni znanstveni članek
Opis: An edge-girth-regular graph egr(n, k, g, λ) is a k-regular graph of order n, girth g and with the property that each of its edges is contained in exactly λ distinct g-cycles. We present new families of edge-girth regular graphs arising from generalized quadrangles and pencils of elliptic quadrics.
An egr(n, k, g, λ) is called extremal for the triple (k, g, λ) if n is the smallest order of any egr(n, k, g, λ). We give new lower bounds for the order of extremal edge-girth-regular graphs using properties of the eigenvalues of the adjacency matrix of a graph.
Ključne besede: cage problem, extremal graph theory, generalized polygons, ovoids
Objavljeno v RUP: 22.10.2025; Ogledov: 389; Prenosov: 1
Celotno besedilo (358,49 KB)
