Absolute algebraic connectivity of trees
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- The symbiotic relationship of combinatorics and matrix theory
- Some minimax problems for graphs
- Laplacian matrices of graphs: A survey
- Synchronization of diffusively coupled systems on compact Riemannian manifolds in the presence of drift
- The six classes of trees with the largest algebraic connectivity
- Convergence and synchronization in networks of piecewise-smooth systems via distributed discontinuous coupling
- On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
- The rotational dimension of a graph
- Comparison inequalities and fastest-mixing Markov chains
- Algebraic connectivity of weighted trees under perturbation
- A minimax problem for graphs and its relation to generalized doubly stochastic matrices
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- Estimating modes of a complex dynamical network from impulse response data: structural and graph-theoretic characterizations
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
- Laplace eigenvalues of graphs---a survey
- Maximization of the first Laplace eigenvalue of a finite graph
- Conformally rigid graphs
- Inverse Fiedler vector problem of a graph
- Old and new results on algebraic connectivity of graphs
- Absolute algebraic connectivity of double brooms and trees
- A survey of automated conjectures in spectral graph theory
- A note on Fiedler vectors interpreted as graph realizations
This page was built for publication: Absolute algebraic connectivity of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4710993)
