A bound on the algebraic connectivity of a graph in terms of the number of cutpoints

By S. Kirkland. 2000

50 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/75af230920125cb7ff35ac01b1aa7e00e5081e2f

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. N. Abreu
2. Arpita Ghosh
3. Stephen P. Boyd
4. Brendan O'Donoghue
5. Steven Diamond
6. Stamatios Lefkimmiatis
7. Jaehyun Park
8. Ali H. Sayed

In Computer Networks and Communications

1. Arpita Ghosh
2. Stephen P. Boyd
3. N. Abreu
4. Angelia Nedić
5. Ali H. Sayed
6. Nicolas Loizou
7. Reza Olfati-Saber
8. Soummya Kar

In Geometry and Topology

1. N. Abreu
2. Arpita Ghosh
3. Stephen P. Boyd

Citations in the corpus

• Upper bounds on algebraic connectivity via convex optimization (2006, background): “In [15] and [14], the author provides tight upper bounds for the algebraic connectivity of a graph with a given number of cut-points.”
• Old and new results on algebraic connectivity of graphs (2007, background): “Kirkland [43] builds an upper bound on a(G) for the case that 1 k n2 and characterizes graphs which attain that bound.”