Recursive constructions of small regular graphs of given degree and girth

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We revisit and generalize a recursive construction due to Sachs involving two graphs which increases the girth of one graph and the degree of the other. We investigate the properties of the resulting graphs in the context of cages and construct families of small graphs using geometric graphs, Paley graphs, and techniques from the theory of Cayley maps. © 2011 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Exoo, G., & Jajcay, R. (2012). Recursive constructions of small regular graphs of given degree and girth. Discrete Mathematics, 312(17), 2612–2619. https://doi.org/10.1016/j.disc.2011.10.021

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free