On the minimum number of edges of two-connected graphs with given diameter
Under an Elsevier user license
open archive
Highlights
► We introduce the notion of peri-eccentricity which relates the trail decomposition of lobes to the diameter a graph. ► We give a tight minimum bound for the number of edges of a 2-connected graph with given diameter. ► We prove a tight minimum bound for the number of edges of a 2-edge-connected graph with given diameter.
Keywords
2-connectedness
Diameter
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.