On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
From MaRDI portal
Recommendations
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Algebraic connectivity and disjoint vertex subsets of graphs
- scientific article; zbMATH DE number 7473309
- On graphs with equal algebraic and vertex connectivity
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
Cites work
Cited in
(11)- Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality
- Upper bounds on algebraic connectivity via convex optimization
- ON THE ALGEBRAIC EMBEDDABILITY IN THE CLASS OF FUNCTIONS POSSESSING CONNECTED GRAPHS
- Old and new results on algebraic connectivity of graphs
- On graphs with equal algebraic and vertex connectivity
- Some minimax problems for graphs
- scientific article; zbMATH DE number 2246587 (Why is no real title available?)
- Conjectures on index and algebraic connectivity of graphs
- Absolute algebraic connectivity of double brooms and trees
- On algebraic connectivity of graphs with at most two points of articulation in each block
- Algebraic connectivity and disjoint vertex subsets of graphs
This page was built for publication: On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147574)