| Authors | حسن طاهری,غلامحسین فتح تبار فیروزجائی |
|---|
| Journal | Mathematics Interdisciplinary Research |
|---|
| Page number | 185 |
|---|
| Volume number | 9 |
|---|
| Paper Type | Full Paper |
|---|
| Published At | 2024-06-01 |
|---|
| Journal Grade | Scientific - research |
|---|
| Journal Type | Typographic |
|---|
| Journal Country | Iran, Islamic Republic Of |
|---|
| Journal Index | ISC |
|---|
Abstract
Consider a simple, undirected graph , where represents the adjacency matrix and represents the Laplacian matrix of G=(V,E) . The second smallest eigenvalue of Laplacian matrix of is called the algebraic connectivity of . 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.
