 On (k,g)-graphs without (g + 1)-cyclesLeonard Chidiebere Eze, Robert Jajcay and Jorik Jooken Applied Mathematics and Computation, 2026, vol. 508, issue C Abstract: A (k,g,g+1_)-graph is a k-regular graph of girth g which does not contain cycles of length g+1. Such graphs are known to exist for all parameter pairs k≥3,g≥3, and we focus on determining the orders n(k,g,g+1_) of the smallest (k,g,g+1_)-graphs. This problem can be viewed as a special case of the previously studied Girth Pair Problem, the problem of finding the order of a smallest k-regular graph in which the length of a smallest even length cycle and the length of a smallest odd length cycle are prescribed. When considering the case of an odd girth g, this problem also yields results towards the Cage Problem, the problem of finding the order of a smallest k-regular graph of girth g. We establish the monotonicity of the function n(k,g,g+1_) with respect to increasing g, and present universal lower bounds for the values n(k,g,g+1_). We propose an algorithm for generating all (k,g,g+1_)-graphs on n vertices, use this algorithm to determine several of the smaller values n(k,g,g+1_), and discuss various approaches to finding smallest (k,g,g+1_)-graphs within several classes of highly symmetrical graphs. Keywords: k-regular graphs; Girth; Cycle structure; Extremal graphs; Cage problem; Graph generation algorithm (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003716 DOI: 10.1016/j.amc.2025.129645 Access Statistics for this article Applied Mathematics and Computation is currently edited by Theodore Simos More articles in Applied Mathematics and Computation from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.