On the order of graphs with a given girth pair
From MaRDI portal
Publication:394547
DOI10.1016/J.DISC.2013.12.015zbMATH Open1281.05051OpenAlexW2064878033MaRDI QIDQ394547FDOQ394547
Authors: C. Balbuena, J. Salas 
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.12.015
Recommendations
Cites Work
- Title not available (Why is that?)
- The minimal trivalent graphs with given smallest odd cycle
- On (minimal) regular graphs of girth \(6\)
- Constructions of small regular bipartite graphs of girth 6
- On geometric constructions of \((k,g)\)-graphs
- Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices
- The 10-cages and derived configurations
- Dynamic cage survey
- Title not available (Why is that?)
- Cages—a survey
- On cages for girth pair \((6,b)\)
- On the monotonicity of \((k;g,h)\)-graphs
- Regular graphs with given girth pair
- A lower bound on the order of regular graphs with given girth pair
- Title not available (Why is that?)
- Graphs with even girth and small excess
- Smallest regular graphs with prescribed odd girth
Cited In (7)
- On ordering of complements of graphs with respect to matching numbers
- Title not available (Why is that?)
- A note on the upper bound and girth pair of (\(k;g\))-cages
- On the monotonicity of \((k;g,h)\)-graphs
- Spectra of orders for \(k\)-regular graphs of girth \(g\)
- On a conjecture on the order of cages with a given girth pair
- Ordering \(Q\)-indices of graphs: given size and circumference
This page was built for publication: On the order of graphs with a given girth pair
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394547)
