3 papers
math.CO2024
On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration
Robert Jajcay, Jorik Jooken, István Porupsánszki
A vertex-girth-regular -graph is a -regular graph of girth and order in which every vertex belongs to exactly cycles of length . While all vertex-tr…
math.CO2024
On extremal (almost) edge-girth-regular graphs
Gabriela Araujo-Pardo, György Kiss, István Porupsánszki
A -regular graph of girth is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly distinct cycles. An egr-graph is called…
math.CO2023
On edge-girth-regular graphs: lower bounds and new families
István Porupsánszki
An edge-girth-regular graph is a regular graph of order , girth and with the property that each of its edges is contained in exactly distinct cycl…