On the second minimum algebraic connectivity of the graphs whose complements are trees
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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2017-12-01
|
Series: | AKCE International Journal of Graphs and Combinatorics |
Subjects: | |
Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.03.005 |