Sharp Bounds on the Diameter of a Graph

DOI10.4153/CMB-1987-010-0zbMATH Open0575.05038MaRDI QIDQ3693545FDOQ3693545

Authors: W. F. Smyth 

Publication date: 1987

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

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

zbMATH Keywords

diametersharp boundconnected undirected graph

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Diameter determination on restricted graph families
• Diameter bounds for planar graphs
• Title not available (Why is that?)
• On upper bounds in tree-diameter sets of 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)