20.500.12556/RUP-22078 On extremal (almost) edge-girth-regular graphs Ekstremni (skoraj) povezavno in ožinskoregularni grafi 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. edge-girth-regular graph cage problem finite biaffine planes povezavno in ožinsko regularen graf problem kletk končne biafine ravnine true false true Založba Univerze na Primorskem Angleški jezik Slovenski jezik Članek v reviji 2025-11-03 12:38:20 2025-11-03 12:38:20 2025-11-18 03:05:49 0000-00-00 00:00:00 2025 0 0 21 str. no. 3, [article no.] P3.05 Vol. 8 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 2025-05-26 519.17 2590-9770 10.26493/2590-9770.1733.dc9 ADAM_Araujo-Pardo,Kiss,Porupsanszki_2025.pdf ADAM_Araujo-Pardo,Kiss,Porupsanszki_2025.pdf 1 5065E4C5C886948FB0A02F5BBAA18280 cc5a7cceced6638f09164d213da1ae1e39fba385c3a6ad9726bc4d9a0a87ea5c 8933f699-b8aa-11f0-8f0b-005056ac49c0 https://repozitorij.upr.si/Dokument.php?lang=slv&id=32023 Založba Univerze na Primorskem 0 0 0