Title of article
On Minimum Algebraic Connectivity of Tricyclic Graphs
Author/Authors
Taheri ، Hassan Department of Pure Mathematics - Faculty of Mathematical Science - University of Kashan , Fath-Tabar ، Gholam Hossein Department of Pure Mathematics - Faculty of Mathematical Science - University of Kashan
From page
185
To page
197
Abstract
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.
Keywords
Algebraic connectivity , Bicyclic graph , Tricyclic graph , Python programming language
Journal title
Mathematics Interdisciplinary Research
Journal title
Mathematics Interdisciplinary Research
Record number
2765864
Link To Document