Diameter Bounds for Planar Graphs

Details Diameter Bounds for Planar Graphs Diameter Bounds for Planar Graphs

2010-06-12

arxiv.org/abs/1006.2493v1

Mathematics

Combinatorics

Scientific paper

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a crucial surgery method, we begin by proving the simpler related upper bounds (4(V-1)-E)/3 and 4V^2/3E on the diameter (for connected planar graphs), which are also tight.

Affiliated with

Also associated with

No associations

Rating

Diameter Bounds for Planar Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Diameter Bounds for Planar Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Diameter Bounds for Planar Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-625326