A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
By Domingos Moreira Cardoso, Dragos M. Cvetkovic, Peter Rowlinson, Slobodan K. Simic. 2008
109 citations recorded by the source corpus.
Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Organic Chemistry
View Paper: https://www.semanticscholar.org/paper/aa854bd25fbbfe86e1bc77745f58eba1daada0b3
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
- Lihua Feng
- Dragos M. Cvetkovic
- Slobodan K. Simic
- Vladimir Nikiforov
- N. Abreu
- L. Lov'asz
- Peter Rowlinson
- Christian Reiher
In Geometry and Topology
- Vladimir Nikiforov
- Slobodan K. Simic
- Lihua Feng
- Dragos M. Cvetkovic
- Guihai Yu
- N. Abreu
- Carla Silva Oliveira
- L. Lima
In Organic Chemistry
- Vladimir Nikiforov
- Slobodan K. Simic
- Dragos M. Cvetkovic
- Lihua Feng
- Guihai Yu
- N. Abreu
- Carla Silva Oliveira
- L. Lima
Citations in the corpus
- Towards a spectral theory of graphs based on the signless Laplacian, I (2009, background): “As our bibliography shows, several papers on the signless Laplacian spectrum (in particular, [2], [5], [10], [12], [14], [15], [16], [24], [26], [28], [29], [30], [31], [32], [35], where the signless Laplacian is explicitly used) have been published since 2005.”
- The smallest eigenvalue of the signless Laplacian (2011, background): “Since for a connected non-bipartite graph G we have qmin (G) > 0, a natural but rather tough question is how small can qmin (G) be in this case? This question was answered by Cardoso, Cvetković, Rowlinson and Simić in [2] as follows: Theorem 1.”
- ON THREE CONJECTURES INVOLVING THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS (2009, background): “In [7], the authors studied the smallest signless Laplacian eigenvalue of non-bipartite graphs.”