20.500.12556/RUP-22020 On edge-girth-regular graphs: lower bounds and new families Povezavno ožinsko regularni grafi: spodnje meje in nove družine 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. cage problem extremal graph theory generalized polygons ovoids problem kletke ekstremalna teorija grafov posplošeni mnogokotniki ovoidi true false true Založba Univerze na Primorskem Angleški jezik Slovenski jezik Članek v reviji 2025-10-22 22:16:21 2025-10-22 22:16:21 2025-11-15 03:03:06 0000-00-00 00:00:00 2025 0 0 15 str. no. 4, [article no.] P4.07 Vol. 25 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-08-22 519.17 1855-3974 https://doi.org/10.26493/1855-3974.3107.9df AMC_Porupsanszki_2025.pdf AMC_Porupsanszki_2025.pdf 1 E735666385C53AA8C42F4E97D01ED175 75e69a51b711c2c052615559a5608a18330dedda418a23aa9db70b59e4b38146 95687857-af84-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=31955 Založba Univerze na Primorskem 0 0 0