On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs (Q3147574)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1803281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs |
scientific article; zbMATH DE number 1803281 |
Statements
On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs (English)
0 references
14 January 2003
0 references
absolute algebraic connectivity
0 references
weighted Laplacian matrix
0 references
weighted graph
0 references
vertex connectivity
0 references
0.8230836391448975
0 references
0.8230834603309631
0 references
0.8183088898658752
0 references
0.8169466853141785
0 references
Given a graph \(G=(V,E)\), its absolute algebraic connectivity is defined as the supremum of the second smallest eigenvalue of its weighted Laplacian matrix \(L_w\) over the set of all nonnegative edge-weightings \(w\) satisfying \(\sum_{(i,j)\in E} w_{ij}=|E|\). The authors find an attainable upper bound on the absolute algebraic connectivity of all graphs with a given number of vertices \(n\) and a given vertex connectivity \(v\), \(1\leq v\leq n-2\), and provide examples of graphs for which this bound is attained.
0 references