On the second minimum algebraic connectivity of the graphs whose complements are trees

Abstract

For a graph the algebraic connectivity denoted by , is the second smallest eigenvalue of the Laplacian matrix of . In Jiang et al. (2015), proved a unique graph with first minimum algebraic connectivity among the graphs which belong to a class of graphs whose complements are trees. In this paper, we characterize the unique graph with second minimum algebraic connectivity in the same aforesaid class of graphs.

Keywords

• laplacian matrix
• algebraic connectivity
• complement of trees