Bipartiteness and the least eigenvalue of signless Laplacian of graphs

By Shaun M. Fallat, Yi-Zheng Fan. 2012

54 citations recorded by the source corpus.

Subfields: Geometry and Topology, Materials Chemistry, Organic Chemistry

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

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

1. Thomas Zaslavsky
2. Lizhu Sun
3. Changjiang Bu
4. Wenzhe Wang
5. Jiang Zhou
6. Nathan Reff
7. Lucas J. Rusnak

In Materials Chemistry

1. Thomas Zaslavsky
2. Lizhu Sun
3. Changjiang Bu
4. Wenzhe Wang
5. Jiang Zhou

In Organic Chemistry

1. Thomas Zaslavsky
2. Lizhu Sun
3. Changjiang Bu
4. Wenzhe Wang
5. Jiang Zhou

Citations in the corpus

• Some results on resistance distances and resistance matrices (2015, methodology): “As introduced in [16], the algebraic bipartiteness of a graph G, denoted by qb(G), is defined as the smallest eigenvalue of QG .”
• A Mathematical Bibliography of Signed and Gain Graphs and Allied Areas (2018, methodology): “1993a Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. J. Assoc. Comput. Mach. 40 (1993), 791–830.”