On the nullity of connected graphs with least eigenvalue at least \(-2\) (Q6486688)
From MaRDI portal
(Redirected from Item:Q2929892)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the nullity of connected graphs with least eigenvalue at least -2 |
scientific article; zbMATH DE number 6369863
- On the nullity of connected graphs with least eigenvalue at least -2
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the nullity of connected graphs with least eigenvalue at least \(-2\) |
scientific article; zbMATH DE number 6369863 |
|
Statements
On the nullity of connected graphs with least eigenvalue at least \(-2\) (English)
0 references
On the nullity of connected graphs with least eigenvalue at least -2 (English)
0 references
14 November 2014
0 references
Let \(\mathcal L\) and \(\mathcal L^+\) be the set of connected graphs with least eigenvalue at least \(-2\) and larger than \(-2\), respectively. The nullity of a graph \(G\) is the multiplicity of zero as an eigenvalue of \(G\). Here, the nullity set of \(\mathcal L^+\) and an upper bound on the nullity of exceptional graphs are given. In particular, an expression for the nullity of generalized line graphs is also given.
0 references
adjacency matrix
0 references
signless Laplacian matrix
0 references
generalized line graph
0 references
0.92536885
0 references
0.92170936
0 references
0.9212186
0 references
0.91953045
0 references
0.9128839
0 references
0.90746593
0 references
0.9069552
0 references
0.9044787
0 references