Partial characterization of graphs having a single large Laplacian eigenvalue (Q668039)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7032071
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial characterization of graphs having a single large Laplacian eigenvalue |
scientific article; zbMATH DE number 7032071 |
Statements
Partial characterization of graphs having a single large Laplacian eigenvalue (English)
0 references
5 March 2019
0 references
Summary: The parameter \(\sigma(G)\) of a graph \(G\) stands for the number of Laplacian eigenvalues greater than or equal to the average degree of \(G\). In this work, we address the problem of characterizing those graphs \(G\) having \(\sigma(G)=1\). Our conjecture is that these graphs are stars plus a (possible empty) set of isolated vertices. We establish a link between \(\sigma(G)\) and the number of anticomponents of \(G\). As a by-product, we present some results which support the conjecture, by restricting our analysis to cographs, forests, and split graphs.
0 references
Laplacian matrix
0 references
Laplacian eigenvalues
0 references
0.96456033
0 references
0.9370993
0 references
0.92461735
0 references
0.92449844
0 references
0.9151224
0 references
0.91453844
0 references
0 references
0.91212183
0 references
