Sharp Bounds on the Diameter of a Graph

DOI10.4153/CMB-1987-010-0MaRDI QIDQ3693545zbMATH OpenFDO

Authors W. F. Smyth

Publication date 1987

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1987-010-0

zbMATH Keywords

connected undirected graphdiametersharp bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Radius, diameter, and minimum degree
• Radius, diameter and the degree sequence of a graph
• scientific article; zbMATH DE number 1472184
• On size, order, diameter and edge-connectivity of graphs
• On upper bounds in tree-diameter sets of graphs

Cited in

(6)

• A generalisation of the diameter of a graph
• scientific article; zbMATH DE number 3957152 (Why is no real title available?)
• On upper bounds in tree-diameter sets of graphs
• scientific article; zbMATH DE number 1262798 (Why is no real title available?)
• Diameter determination on restricted graph families
• Diameter bounds for planar graphs

This page was built for publication: Sharp Bounds on the Diameter of a Graph

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