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...
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: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/995 |
Similar Items
-
Graphs with Large Generalized (Edge-)Connectivity
by: Li Xueliang, et al.
Published: (2016-11-01) -
A note on the generator subgraph of a graph
by: Neil Mores Mame, et al.
Published: (2020-04-01) -
Large Contractible Subgraphs of a 3-Connected Graph
by: Karpov Dmitri V.
Published: (2021-02-01) -
Connected Tropical Subgraphs in Vertex-Colored Graphs
by: Jean-Alexandre Anglès d'Auriac, et al.
Published: (2016-08-01) -
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
by: Li Binlong, et al.
Published: (2016-11-01)