Abstract
The algebraic connectivity of a graph is the second smallest eigenvalue of its Laplacian matrix. Algebraic connectivity is closely related to the traditional vertex (edge) connectivity and it plays an important role in the design of various networks. In this paper, we determine the graph which has the minimum algebraic connectivity among all connected graphs with given circumference.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have