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

Geoffrey Exoo (), Robert Jajcay () and Tom Raiman ()
Additional contact information
Geoffrey Exoo: Indiana State University
Robert Jajcay: Comenius University
Tom Raiman: VŠB - Technical University of Ostrava

Journal of Combinatorial Optimization, 2023, vol. 46, issue 4, No 4, 14 pages

Abstract: Abstract A $$(k,g)$$ ( k , g ) -graph is a k-regular graph of girth $$g$$ g . Given $$k\ge 2$$ k ≥ 2 and $$g\ge 3$$ g ≥ 3 , $$(k,g)$$ ( k , g ) -graphs of infinitely many orders are known to exist and the problem of finding a (k, g)-graph of the smallest possible order is known as the Cage Problem. The aim of our paper is to develop systematic (programmable) ways for lowering the orders of existing $$(k,g)$$ ( k , g ) -graphs, while preserving their regularity and girth. Such methods, in analogy with the previously used excision, may have the potential for constructing smaller (k, g)-graphs from current smallest examples—record holders—some of which have not been improved in years. In addition, we consider constructions that preserve the regularity, the girth and the order of the considered graphs, but alter the graphs enough to possibly make them suitable for the application of our order decreasing methods. We include a detailed discussion of several specific parameter cases for which several non-isomorphic smallest examples are known to exist, and address the question of the distance between these non-isomorphic examples based on the number of changes required to move from one example to another.

Keywords: Cage; k-regular graph of girth g; Recursive construction; Distance between graphs (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01092-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:46:y:2023:i:4:d:10.1007_s10878-023-01092-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01092-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().