On conjectures involving second largest signless Laplacian eigenvalue of graphs

By K. C. Das. 2010

119 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/a3f28092eb62386229593cf2c137bdb362505c21

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. Vladimir Nikiforov
2. Carla Silva Oliveira
3. Thomas Zaslavsky
4. L. Lima
5. N. Abreu
6. L. Lov'asz
7. Peter Rowlinson
8. Christian Reiher

In Geometry and Topology

1. Vladimir Nikiforov
2. Carla Silva Oliveira
3. Thomas Zaslavsky
4. L. Lima
5. N. Abreu
6. Xiaodong Zhang
7. Yongtao Li
8. L. Lov'asz

In Organic Chemistry

1. Vladimir Nikiforov
2. Carla Silva Oliveira
3. Thomas Zaslavsky
4. L. Lima
5. N. Abreu
6. Xiaodong Zhang

Citations in the corpus

• The smallest eigenvalue of the signless Laplacian (2011, background): “Another upper bound due to Das [9] reads as: if u and v are vertices in G that are adjacent but have no common neighbors, then”
• A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas (2018, background): ““Coloring” is clustering as in Davis (1967a). Thm.”