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: | Stanic, Zoran; Faculty of Mathematics, University of Belgrade, Studentski trg 16, 11 000 Belgrade, Serbia (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!
|
Similar Items
-
On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound
by: Agustin, Ika Hesti, et al.
Published: (2018) -
A note on the generator subgraph of a graph
by: Mame, Neil Mores; College of Arts and Sciences, Batangas State University, Batangas City, Philippines, et al.
Published: (2020) -
On the ascending subgraph decomposition problem for bipartite graphs
by: J. M. Aroca, et al.
Published: (2017) -
New bounds on the hyper-Zagreb index for the simple connected graphs
by: Elumalai, Suresh; Department of Mathematics, Velammal Engineering College, Surapet, Chennai-66, Tamil Nadu, India, et al.
Published: (2018) -
Upper bounds on the bondage number of a graph
by: Samodivkin, Vladimir Dimitrov; Departments of Mathematics, University of Architecture, Civil Engineering and Geodesy, Sofia, Bulgaria
Published: (2018)