Maximizing algebraic connectivity for certain families of graphs
From MaRDI portal
Publication:2261533
DOI10.1016/j.laa.2014.12.023zbMath1307.05141arXiv1412.6147MaRDI QIDQ2261533
Publication date: 6 March 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.6147
68M10: Network design and communication in computer systems
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, Hypergraph analysis based on a compatible tensor product structure, Augmenting the algebraic connectivity for certain families of graphs, Deterministic versus stochastic consensus dynamics on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational determination of (3,11) and (4,7) cages
- Graphs with given diameter maximizing the algebraic connectivity
- Tight bounds on the algebraic connectivity of Bethe trees
- Old and new results on algebraic connectivity of graphs
- Eigenvalues and expanders
- The expected eigenvalue distribution of a large regular graph
- On the second eigenvalue and random walks in random \(d\)-regular graphs
- Constructions for cubic graphs with large girth
- The spectrum of the Laplacian matrix of a balanced binary tree
- Tight estimates for eigenvalues of regular graphs
- Diffusion dynamics in small-world networks with heterogeneous consumers
- Dynamic cage survey
- Maximum algebraic connectivity augmentation is NP-hard
- Experimental Design for Biological Systems
- Expander graphs in pure and applied mathematics
- The Laplacian Spectrum of a Graph
- Expander graphs and their applications
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Fastest Mixing Markov Chain on a Graph
- Tight bounds on the algebraic connectivity of a balanced binary tree
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
