Bounds and conjectures for the signless Laplacian index of graphs

By Pierre Hansen, Claire Lucas. 2009

55 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry

View Paper: https://www.semanticscholar.org/paper/8116875e04fb4e9d7b08b996abd36cc2c41adb03

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Slobodan K. Simic
2. Dragos M. Cvetkovic
3. Bian He
4. Ya-Lei Jin
5. Xiaodong Zhang
6. Vladimir Nikiforov
7. Pierre Hansen
8. Zoran Stanic

In Geometry and Topology

1. Slobodan K. Simic
2. Dragos M. Cvetkovic
3. Xiaodong Zhang
4. Bian He
5. Ya-Lei Jin
6. Vladimir Nikiforov
7. Zoran Stanic
8. Pierre Hansen

In Organic Chemistry

1. Slobodan K. Simic
2. Dragos M. Cvetkovic
3. Xiaodong Zhang
4. Vladimir Nikiforov
5. Pierre Hansen
6. Mustapha Aouchiche
7. Zoran Stanic
8. N. Abreu

Citations in the corpus

• Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number (2012, background): “2 ([8]) Let G be a connected graph on n ≥ 6 vertices with signless Laplacian spectral radius q1 and chromatic number χ.”
• Towards a spectral theory of graphs based on the signless Laplacian, III (2010, background): “In the meantime the following 16 papers [2], [13], [ 18 ], [19], [21], [28], [29], [30], [31], [32], [38], [42], [45], [49], [51], [53] have been published or are in the process of publication at this moment.”