Line graphs of trees with the largest eigenvalue multiplicity
From MaRDI portal
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.
Recommendations
- The eigenvalue multiplicity of line graphs
- On multiple eigenvalues of trees
- A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices
- On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
- Trees with a large Laplacian eigenvalue multiplicity
Cites work
- 4-regular oriented graphs with optimum skew energies
- A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
- A characterization of graphs with rank 4
- A characterization of graphs with rank 5
- A note on the multiplicities of graph eigenvalues
- An upper bound for the nullity of a bipartite graph in terms of its maximum degree
- An upper bound of the nullity of a graph in terms of order and maximum degree
- Domination number and Laplacian eigenvalue distribution
- Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
- scientific article; zbMATH DE number 6100973 (Why is no real title available?)
- scientific article; zbMATH DE number 3414355 (Why is no real title available?)
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- On eigenvalue multiplicity and the girth of a graph
- On multiple eigenvalues of trees
- On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- On the multiplicity of as an A_()-eigenvalue of signed graphs with pendant vertices
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- On the multiplicity of eigenvalues of trees
- On the nullity and the matching number of unicyclic graphs
- On the nullity of a graph with cut-points
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of line graphs of trees
- On the nullity of unicyclic graphs
- On the trees with maximum nullity
- Permanental roots and the star degree of a graph
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Spectra of graphs
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- The Parter--Wiener Theorem: Refinement and Generalization
- The positive and the negative inertia index of line graphs of trees
- Thekth Laplacian eigenvalue of a tree
- Trees with maximum nullity
Cited in
(7)- scientific article; zbMATH DE number 5123568 (Why is no real title available?)
- The eigenvalue multiplicity of line graphs
- On the multiplicity of 1 as a Laplacian eigenvalue of a graph
- Upper bound of the multiplicity of Laplacian eigenvalue 1 of trees
- Line graphs with the largest eigenvalue multiplicity
- Upper bounds for the multiplicity of Laplacian eigenvalues of graphs
- Trees with extremal Laplacian eigenvalue multiplicity
This page was built for publication: Line graphs of trees with the largest eigenvalue multiplicity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178770)