Signless Laplacians and line graphs

By Dragos M. Cvetkovic. 2005

55 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/83c067abb3b9149774be2f5e7b291282b62529ab

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. Peter Rowlinson
3. Slobodan K. Simic
4. Lihua Feng
5. Dragos M. Cvetkovic
6. Guihai Yu
7. N. Abreu
8. Carla Silva Oliveira

In Geometry and Topology

1. Vladimir Nikiforov
2. Slobodan K. Simic
3. Dragos M. Cvetkovic
4. Lihua Feng
5. Peter Rowlinson
6. Guihai Yu
7. N. Abreu
8. Carla Silva Oliveira

In Organic Chemistry

1. Vladimir Nikiforov
2. Slobodan K. Simic
3. Dragos M. Cvetkovic
4. Lihua Feng
5. Guihai Yu
6. N. Abreu
7. Peter Rowlinson
8. Carla Silva Oliveira

Citations in the corpus

• The smallest eigenvalue of the signless Laplacian (2011, background): “The matrix Q = A+D, called the signless Laplacian or the Q-matrix of G, has received a lot of attention in the recent years, especially after Cvetković put forward the study of this matrix in [4], see also [5],[6] and [7].”
• Merging the A- and Q-spectral theories (2016, methodology): “In this paper we study hybrids of A (G) and D (G) similar to the signless Laplacian Q (G) := A (G) + D (G), put forth by Cvetković in [5] and extensively studied since then.”
• ON THREE CONJECTURES INVOLVING THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS (2009, background): “More information about the signless Laplacian can be found in [2], [3], [5], [6].”
• Towards a spectral theory of graphs based on the signless Laplacian, I (2009, background): “This difficulty can be overcome by requiring that always, together with the í µí±„-spectrum of a graph, the number of components is given, as explained in [4] (and [9] ).”
• 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].”
• EIGENVALUE BOUNDS FOR THE SIGNLESS LAPLACIAN (2007, background): “Therefore it was suggested in [4, 8] that, when handling graphs by means of Q-spectra, we should assume or require that in addition to the Q-eigenvalues, the number of components is also prescribed.”
• Signless Laplacians of finite graphs (2007, background): “These arguments have been developed in detail in the paper [3].”