scientific article; zbMATH DE number 7473309
From MaRDI portal
Publication:5029439
Recommendations
- Bounds on the algebraic connectivity of graphs
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- An upper bound on algebraic connectivity of graphs with many cutpoints
- Some new lower bounds on the algebraic connectivity of graphs
- An upper bound on the algebraic connectivity of outerplanar graphs
- The Nordhaus-Gaddum bounds for algebraic connectivity of graphs
- A conjecture on algebraic connectivity of graphs
- Upper bounds on algebraic connectivity via convex optimization
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- On the \(d\)-dimensional algebraic connectivity of graphs
Cites work
- Bounds of Laplacian spectrum of graphs based on the domination number
- Bounds on graph eigenvalues. I
- Exploring complex networks
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 2246587 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Maximizing algebraic connectivity for certain families of graphs
- Old and new results on algebraic connectivity of graphs
- On graphs with algebraic connectivity equal to minimum edge density
- Ordering trees and graphs with few cycles by algebraic connectivity
Cited in
(22)- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- A lower bound for the algebraic connectivity of a graph in terms of the domination number
- Maximizing algebraic connectivity for certain families of graphs
- An upper bound on the algebraic connectivity of outerplanar graphs
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- The sharpness of a lower bound on the algebraic connectivity for maximal graphs
- An upper bound on algebraic connectivity of graphs with many cutpoints
- On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
- Extremizing algebraic connectivity subject to graph theoretic constraints
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- The Nordhaus-Gaddum bounds for algebraic connectivity of graphs
- Lower bounds for the algebraic connectivity of graphs with specified subgraphs
- Bounds on the algebraic connectivity of graphs
- Estimating the algebraic connectivity of triangle-free graphs
- Some new lower bounds on the algebraic connectivity of graphs
- Conjectures on index and algebraic connectivity of graphs
- Title not available (Why is no real title available?)
- Upper bounds on algebraic connectivity via convex optimization
- On the algebraic connectivity of graphs as a function of genus
- Old and new results on algebraic connectivity of graphs
- Computing tight upper bounds on the algebraic connectivity of certain graphs
- A sharp upper bound on algebraic connectivity using domination number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5029439)