Sharp Bounds on the Diameter of a Graph Academic Article uri icon

  •  
  • Overview
  •  
  • Research
  •  
  • Identity
  •  
  • Additional Document Info
  •  
  • View All
  •  

abstract

  • AbstractLet Dn.m, be the diameter of a connected undirected graph on n ≥2 vertices and n - 1 ≤ ms(n) edges, where s(n) = n(n — l)/2. Then Dn.s(n) = 1, and for ms(n) it is shown thatThe bounds on Dn.m, are sharp.

publication date

  • March 1, 1987