Lower bounds for the algebraic connectivity of graphs with specified subgraphs

Lower bounds for the algebraic connectivity of graphs with specified subgraphs

<p>The second smallest eigenvalue of the Laplacian matrix of a graph <span class="math inline"><em>G</em></span> is called the algebraic connectivity and denoted by <span class="math inline"><em>a</em>(<em>G</em>)</sp...

Full description

Bibliographic Details
Main Author: Zoran Stanic
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2021-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
edge-disjoint subgraphs, laplacian matrix, algebraic connectivity, geometric mean, hamiltonian cycle
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/995

Internet

https://www.ejgta.org/index.php/ejgta/article/view/995

Similar Items