Old and new results on algebraic connectivity of graphs

By N. Abreu. 2007

452 citations recorded by the source corpus.

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

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

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. Sriparna Chattopadhyay
2. Nicolas Loizou
3. T. Von
4. Pratima Panigrahi

In Geometry and Topology

1. Sriparna Chattopadhyay
2. Nicolas Loizou
3. T. Von
4. Pratima Panigrahi

In Organic Chemistry

1. Sriparna Chattopadhyay
2. Nicolas Loizou
3. T. Von
4. Pratima Panigrahi

Citations in the corpus

• On Laplacian spectrum of power graphs of finite cyclic and dihedral groups (2015, background): “In this context, we refer the survey paper [9].”
• Randomized Iterative Methods for Linear Systems: Momentum, Inexactness and Gossip (2019, background): “23) where L = A>A is the Laplacian matrix of the network and the quantity λ+min(L) is the very well studied algebraic connectivity of the graph [31].”
• ALGEBRAIC CONNECTIVITY OF ERDÖS-RÉNYI GRAPHS NEAR THE CONNECTIVITY THRESHOLD (2014, background): “The algebraic connectivity of a graph is defined as the second smallest eigenvalue λ2(L) of the combinatorial graph Laplacian L = D −A, where A is its adjacency matrix and D is the diagonal matrix of vertex degrees [9, 15, 16, 20, 31].”