Lower bounds for the algebraic connectivity of graphs with specified subgraphs
The second smallest eigenvalue of the Laplacian matrix of a graph G is called the algebraic connectivity and denoted by a(G). We prove thata(G)>π2/3(p(12g(n1, n2, ..., np)2 − π2)/4g(n1, n2, ..., np)4 + 4(q − p)(3g(np + 1, np + 2, ..., nq)2 − π2)/g(np + 1, np + 2, ..., nq)4),holds for every non-tr...
Saved in:
| Main Author: | |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-10-16.
|
| Subjects: | |
| Online Access: | Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get Fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |