Bounds for the Least Laplacian Eigenvalue of a Signed Graph
By Yaoping Hou. 2005
80 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Geometry and Topology, Organic Chemistry
View Paper: https://www.semanticscholar.org/paper/6c2096f6effb5b0f4e19bac6d684fd685eec120e
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
- Ernesto William De Luca
- J´erˆome Kunegis
- Sahin Albayrak
- Jürgen Lerner
- Nathan Reff
- Stephan Schmidt
- Andreas Lommatzsch
In Geometry and Topology
- Ernesto William De Luca
- J´erˆome Kunegis
- Sahin Albayrak
- Jürgen Lerner
- Nathan Reff
- Stephan Schmidt
- Andreas Lommatzsch
In Organic Chemistry
- Ernesto William De Luca
- J´erˆome Kunegis
- Sahin Albayrak
- Jürgen Lerner
- Nathan Reff
- Stephan Schmidt
- Andreas Lommatzsch
Citations in the corpus
- Spectral properties of complex unit gain graphs (2011, background): “Recently there has been a growing study of matrices associated to a signed graph [9, 8, 10, 11, 17, 5].”
- Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization (2010, methodology): “The combinatorial Laplacian matrix of signed graphs with edge weights restricted to ±1 is described in [12] where it is called the Kirchhoff matrix (of a signed graph).”