The maximum valency of regular graphs with given order and odd girth

DOI10.1002/JGT.3190160303zbMATH Open0780.05037OpenAlexW2017340732MaRDI QIDQ4013422FDOQ4013422

Authors: Guo-Hui Zhang 

Publication date: 27 September 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160303

Recommendations

• Maximizing the order of a regular graph of given valency and second eigenvalue
• scientific article
• Extremal regular graphs with prescribed odd girth
• scientific article
• The maximum radius of graphs with given order and minimum degree
• scientific article; zbMATH DE number 4043895
• A valency bound for distance-regular graphs
• Maximum matchings in a regular graph of specified connectivity and bounded order
• On a valence problem in extremal graph theory

zbMATH Keywords

regular graphsodd cycleodd girthmaximum valency

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Algebraic Graph Theory

Cited In (3)

• The maximum number of vertices of primitive regular graphs of orders 2, 3, 4 with exponent 2
• Maximizing the order of a regular graph of given valency and second eigenvalue
• Title not available (Why is that?)

This page was built for publication: The maximum valency of regular graphs with given order and odd girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013422)