The sharpness of a lower bound on the algebraic connectivity for maximal graphs

Abstract

Let G be an undirected unweighted graph on n vertices and let L be its Laplacian matrix. It is known that if is the group inverse of L, then for

is a lower bound on the algebraic connectivity μ(G of G Merris has introduced and characterized the class of all maximal graphs of all orders. These are graphs whose degree sequence is not majorized by the degree sequence of any other graph. Here we show that if Ç is a maximal graph and L is its Laplacian, then 1/(L ^#)=μ(Ç). We provide an example to show that the converse of this result is not valid.

Keywords:

• Maximal graphs
• Laplacian matrix
• Algebraic connectivity
• AMS Classifications: 5C50, 15A48

^∗NSERC Grant No. OGP0138251

^†Corresponding author. Supported in part by NSF Grant No. DMS9973247. [email protected]

^∗NSERC Grant No. OGP0138251

^†Corresponding author. Supported in part by NSF Grant No. DMS9973247. [email protected]

Notes

^∗NSERC Grant No. OGP0138251

^†Corresponding author. Supported in part by NSF Grant No. DMS9973247. [email protected]