Line graphs of trees with the largest eigenvalue multiplicity (Q6178770)
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 7734076
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Line graphs of trees with the largest eigenvalue multiplicity |
scientific article; zbMATH DE number 7734076 |
Statements
Line graphs of trees with the largest eigenvalue multiplicity (English)
0 references
5 September 2023
0 references
Given a tree \(T\) with \(p\geq 3\) pendant edges, the authors prove that the multiplicity of any eigenvalue of the line graph of \(T\) is less than \(p\). In addition, the line graphs for which there is an eigenvalue with multiplicity \(p-1\) are fully characterized.
0 references
eigenvalue multiplicity
0 references
nullity
0 references
line graphs
0 references
0 references
0 references
0 references
0 references
0 references
0.8995845913887024
0 references
0.8406431078910828
0 references
0.8378469347953796
0 references
0.8306770324707031
0 references
0.8193434476852417
0 references
