Algebraic connectivity of k-connected graphs.
From MaRDI portal
Publication:5249658
Recommendations
- scientific article; zbMATH DE number 2075777
- Old and new results on algebraic connectivity of graphs
- Algebraic connectivity of connected graphs with fixed number of pendant vertices
- 2-connected graphs with the minimum algebraic connectivity
- The minimum algebraic connectivity of graphs with a given clique number
Cites work
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Algebraic connectivity and the characteristic set of a graph
- Characteristic vertices of weighted trees via perron values
- Laplacian matrices of graphs: A survey
- Old and new results on algebraic connectivity of graphs
- On algebraic connectivity of graphs with at most two points of articulation in each block
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Perron components and algebraic connectivity for weighted graphs
- The influence of Miroslav Fiedler on spectral graph theory
- The perturbed laplacian matrix of a graph
Cited in
(8)- Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size
- Connectivity of some algebraically defined digraphs
- Algebraic connectivity of directed graphs
- The algebraic connectivity of graphs with given matching number
- Algebraic connectivity and disjoint vertex subsets of graphs
- Hamiltonian graphs of given order and minimum algebraic connectivity
- Fiedler vector analysis for particular cases of connected graphs
- The algebraic connectivity of graphs with given circumference
This page was built for publication: Algebraic connectivity of \(k\)-connected graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249658)