Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs

DOI10.1016/j.disc.2011.10.030zbMath1237.05124OpenAlexW2026634729WikidataQ123206187 ScholiaQ123206187MaRDI QIDQ764886

Kinkar Chandra Das

Publication date: 16 March 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.030

zbMATH Keywords

graphsignless Laplacian matrixthe largest signless Laplacian eigenvaluethe smallest signless Laplacian eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (13)

Some properties on the tensor product of graphs obtained by monogenic semigroups ⋮ On the spectral radius of bipartite graphs which are nearly complete ⋮ The signless Laplacian spectral radius of graphs with a prescribed number of edges ⋮ Graph Limits and Spectral Extremal Problems for Graphs ⋮ Proof of conjectures involving algebraic connectivity of graphs ⋮ On incidence energy of graphs ⋮ Proof of conjectures on remoteness and proximity in graphs ⋮ Proof of conjectures on the distance signless Laplacian eigenvalues of graphs ⋮ Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter ⋮ Unnamed Item ⋮ Sharp bounds on the signless Laplacian spread of graphs ⋮ Spectral characterization of line graphs of starlike trees ⋮ The difference between remoteness and radius of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
• Signless Laplacians of finite graphs
• Q-integral graphs with edge-degrees at most five
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• A survey of automated conjectures in spectral graph theory
• Bounds on the \(Q\)-spread of a graph
• The signless Laplacian spectral radius of graphs with given degree sequences
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• The lollipop graph is determined by its \(Q\)-spectrum
• The Laplacian spectrum of a graph
• Sharp lower bounds on the Laplacian eigenvalues of trees
• Hamilton cycles and eigenvalues of graphs
• Eigenvalue bounds for the signless laplacian
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Matrix theory. Basic results and techniques

This page was built for publication: Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs