On the conjecture for certain Laplacian integral spectrum of graphs
From MaRDI portal
Publication:3553227
DOI10.1002/jgt.20412zbMath1209.05141WikidataQ123136226 ScholiaQ123136226MaRDI QIDQ3553227
Gi-Sang Cheon, Sang-Gu Lee, Kinkar Chandra Das
Publication date: 22 April 2010
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20412
graph; diameter; Laplacian spectrum; largest eigenvalue; Laplacian matrix; second smallest eigenvalue
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
On a Conjecture on a Laplacian Matrix with Distinct Integral Spectrum, Two spectral characterizations of regular, bipartite graphs with five eigenvalues, Conjectures on index and algebraic connectivity of graphs, On conjectures involving second largest signless Laplacian eigenvalue of graphs, Proof of conjecture involving algebraic connectivity and average degree of graphs, Proof of conjectures involving algebraic connectivity of graphs, On distance Laplacian spectral determination of complete multipartite graphs
Cites Work
- Unnamed Item
- A note on Laplacian graph eigenvalues
- Laplacian matrices of graphs: A survey
- An improved upper bound for Laplacian graph eigenvalues
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- The Laplacian spectrum of a graph
- Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
- Sharp lower bounds on the Laplacian eigenvalues of trees
- Research problems from the Aveiro workshop on graph spectra
- Thekth Laplacian eigenvalue of a tree
- The Laplacian spectra of graphs with a tree structure
- Eigenvalues of the Laplacian of a graph∗
- On graphs whose Laplacian matrices have distinct integer eigenvalues
- On graphs with equal algebraic and vertex connectivity