On Minimum Algebraic Connectivity of Tricyclic Graphs
نویسندگان
1 Faculty of Mathematical Science, Department of Pure Mathematics, University of Kashan, Kashan 87317-51167, I. R. Iran
2 Faculty of Mathematical Science, Department of Pure Mathematics, University of Kashan, Kashan 87317-51167, I. R. Iran
doi
10.22052/mir.2024.253568.1437چکیده
Consider a simple, undirected graph $ G=(V,E)$, where $A$ represents the adjacency matrix and $Q$ represents the Laplacian matrix of $G$. The second smallest eigenvalue of Laplacian matrix of $G$ is called the algebraic connectivity of $G$. In this article, we present a Python program for studying the Laplacian eigenvalues of a graph. Then, we determine the unique graph of minimum algebraic connectivity in the set of all tricyclic graphs.
