Talk:Algebraic connectivity
Latest comment: 9 years ago by Erik456 in topic Bounds for algebraic connectivity
![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
Values of the algebraic connectivity in actual networks
editFWIW, here's a table of values for the algebraic connectivity for lots of real networks: http://konect.uni-koblenz.de/statistics/alcon –Jérôme (talk) 08:16, 23 January 2014 (UTC)
- Disclaimer, I'm the author of that page.–Jérôme (talk) 08:16, 23 January 2014 (UTC)
Bounds for algebraic connectivity
editI am slightly confused by the sentence 'Furthermore, the value of the algebraic connectivity is bounded above by the traditional (vertex) connectivity of the graph'. It purports to be from [1] but I can find no such statement on that page. Slight testing in Mathematica reveals it to be false for complete graphs (where vertex connectivity = n - 1, algebraic connectivity = n). Any thoughts? Erik (talk) 08:47, 22 May 2015 (UTC)
References
- ^ J.L. Gross and J. Yellen. Handbook of Graph Theory, CRC Press, 2004, page 314