Signless Laplacians of finite graphs

By Dragos M. Cvetkovic, Peter Rowlinson, Slobodan K. Simic. 2007

551 citations recorded by the source corpus.

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

View Paper: https://www.semanticscholar.org/paper/64cc629e3d4bca6eda1e4e14f3d575df934cf4f0

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

In Geometry and Topology

In Organic Chemistry

Citations in the corpus

On the Linear Convergence of the ADMM in Decentralized Consensus Optimization (2013, methodology): “The analysis requires an extra initialization condition that β 0 lies in the column space of M T − (e.g., β 0 = 0 ) such that β k +1 also lies in the column space of M T − ; the reason will be given in Section III.”
On the adjacency matrix of a complex unit gain graph (2018, background): “For more details about the study of classes of matrices associated with graphs, we refer to [1, 3, 4, 5, 6, 12].”
EIGENVALUE BOUNDS FOR THE SIGNLESS LAPLACIAN (2007, background): “From the above considerations, we arrive at the following result (announced in [8]).”
On the distance signless Laplacian of a graph (2014, methodology): “To complete the proof, we use the fact (see [7,11]) that 0 is a Q-eigenvalue of a graph G if and only if G contains a bipartite component or an isolated vertex, and in that case, the multiplicity of 0 is at most equal to the number of bipartite components plus the number of isolated vertices.”
A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph (2008, background): “Several references may be found in the papers [3,4].”
On the A-characteristic polynomial of a graph (2017, background): “1 can also be deduced from theQ-characteristic polynomial of a graph G (see [2], or Corollary 3.”
The largest Laplacian and signless Laplacian H-eigenvalues of a uniform hypergraph (2013, background): “2 reduce to the classic results in graph theory [6].”
Discrete mathematics (2004, unknown): “Exclusive or: p ⊕ q is true when exactly one of p and q is true, and false otherwise Truth table: Instructor:I¸sılDillig, CS311H:DiscreteMathematics Introand PropositionalLogic 25/36”