Absolute algebraic connectivity of trees
From MaRDI portal
Publication:4710993
Recommendations
Cites work
Cited in
(19)- Synchronization of diffusively coupled systems on compact Riemannian manifolds in the presence of drift
- The six classes of trees with the largest algebraic connectivity
- A note on Fiedler vectors interpreted as graph realizations
- Laplacian matrices of graphs: A survey
- Algebraic connectivity of weighted trees under perturbation
- The symbiotic relationship of combinatorics and matrix theory
- Laplace eigenvalues of graphs---a survey
- The rotational dimension of a graph
- Old and new results on algebraic connectivity of graphs
- Some minimax problems for graphs
- Convergence and synchronization in networks of piecewise-smooth systems via distributed discontinuous coupling
- Estimating modes of a complex dynamical network from impulse response data: structural and graph-theoretic characterizations
- Absolute algebraic connectivity of double brooms and trees
- On Vertex Connectivity and Absolute Algebraic Connectivity for Graphs
- A minimax problem for graphs and its relation to generalized doubly stochastic matrices
- Comparison inequalities and fastest-mixing Markov chains
- A survey of automated conjectures in spectral graph theory
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian
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)