An upper bound on algebraic connectivity of graphs with many cutpoints (Q2723257)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An upper bound on algebraic connectivity of graphs with many cutpoints |
scientific article; zbMATH DE number 1614338
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound on algebraic connectivity of graphs with many cutpoints |
scientific article; zbMATH DE number 1614338 |
Statements
An upper bound on algebraic connectivity of graphs with many cutpoints (English)
0 references
9 July 2001
0 references
Laplacian matrix
0 references
cutpoint
0 references
algebraic connectivity
0 references
0.9767982
0 references
0.9330997
0 references
0.9250429
0 references
0.9176428
0 references
0.91532236
0 references
0.91192937
0 references
From author's abstract: Let \(G\) be a graph on \(n\) vertices which has \(k\) cutpoints. A tight upper bound on the algebraic connectivity of \(G\) in terms of \(n\) and \(k\) for the case that \(k> n/2\) is provided; the graphs which yield equality in the bound are also characterized.
0 references
