Maximizing algebraic connectivity for certain families of graphs
Author:
- T. KolokolnikovTKT. Kolokolnikov
- 1 April 2015
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 471, 122-140
Abstract
No abstract availableFunding Information
- NSERC (RGPIN-33798, RGPAS/461907)
This publication has 21 references indexed in Scilit:
- Experimental Design for Biological SystemsSIAM Journal on Control and Optimization, 2012
- Expander graphs in pure and applied mathematicsBulletin of the American Mathematical Society, 2012
- Synchronization in complex networksPhysics Reports, 2008
- Diffusion dynamics in small-world networks with heterogeneous consumersComputational and Mathematical Organization Theory, 2006
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all thatJournal of Statistical Mechanics: Theory and Experiment, 2006
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Fastest Mixing Markov Chain on a GraphSIAM Review, 2004
- An algebraic approach to network codingIEEE/ACM Transactions on Networking, 2003
- Algebraic connectivity of graphsCzechoslovak Mathematical Journal, 1973