Unoriented Laplacian maximizing graphs are degree maximal

By Bit-Shun Tam, Yi-Zheng Fan, Jun Zhou. 2008

55 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/5fd3be8acbee0c58950eacae09b07205827c0f5e

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. Vladimir Nikiforov
4. Pierre Hansen
5. Mustapha Aouchiche
6. Matthew A. Masten

In Geometry and Topology

1. Slobodan K. Simic
2. Dragos M. Cvetkovic
3. Vladimir Nikiforov
4. Pierre Hansen
5. Mustapha Aouchiche
6. Zoran Stanic
7. Francesco Belardo
8. Bo Zhou

In Organic Chemistry

1. Slobodan K. Simic
2. Dragos M. Cvetkovic
3. Vladimir Nikiforov
4. Pierre Hansen
5. Mustapha Aouchiche
6. Zoran Stanic
7. Francesco Belardo

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.”
• Towards a spectral theory of graphs based on the signless Laplacian, III (2010, result): “In the first part of this paper we have mentioned 15 papers (in particular, [4], [6], [10], [15], [20], [22], [23], [35], [39], [41], [43], [44], [46], [47], [55], where the signless Laplacian is used explicitly) in addition to our previous basic papers [5], [9].”