On decreasing the orders of \((k,g)\)-graphs

DOI10.1007/s10878-023-01092-9OpenAlexW4388736253MaRDI QIDQ6181335

Tom Raiman, Jajcay, Robert, Geoffrey Exoo

Publication date: 22 January 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01092-9

zbMATH Keywords

recursive constructioncagedistance between graphs\(k\)-regular graph of girth \(g\)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Small bi-regular graphs of even girth
• Distances between graphs under edge operations
• Edge-girth-regular graphs
• Spectra of orders for \(k\)-regular graphs of girth \(g\)
• Extremal edge-girth-regular graphs
• House of graphs 2.0: a database of interesting graphs and more
• Generalized cages
• Dynamic cage survey
• Biregular Cages of Odd Girth
• Regular Graphs with Given Girth and Restricted Circuits

This page was built for publication: On decreasing the orders of \((k,g)\)-graphs