Algebraic connectivity of directed graphs
From MaRDI portal
Publication:5462825
DOI10.1080/03081080500054810zbMath1065.05048OpenAlexW2016918503MaRDI QIDQ5462825
Publication date: 27 July 2005
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081080500054810
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20) Stability theory for smooth dynamical systems (37C75)
Related Items (25)
Reaching consensus in a variable-topology multiagent system under additive random noise ⋮ On digraphs with polygonal restricted numerical range ⋮ GKSL generators and digraphs: computing invariant states ⋮ Resistance matrices of balanced directed graphs ⋮ Group size, grooming and fission in primates: a modeling approach based on group structure ⋮ On the graph Laplacian and the rankability of data ⋮ Distributed strategies for generating weight-balanced and doubly stochastic digraphs ⋮ Distributed motion constraints for algebraic connectivity of robotic networks ⋮ Even order uniform hypergraph via the Einstein product ⋮ The effect of reverse edges on convergence rate of directed weighted chain network ⋮ Consensus formation in first-order graphon models with time-varying topologies ⋮ Actuator fault accommodation strategy for a team of multi-agent systems subject to switching topology ⋮ On the Laplacian spread of digraphs ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ Distributed estimation of algebraic connectivity of directed networks ⋮ Sharp spectral bounds for the edge-connectivity of regular graphs ⋮ Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence ⋮ Comparing forest governance models against invasive biological threats ⋮ Certifying spatially uniform behavior in reaction-diffusion PDE and compartmental ODE systems ⋮ Which digraphs with ring structure are essentially cyclic? ⋮ Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs ⋮ On algebraic connectivity of directed scale-free networks ⋮ Complex adjacency spectra of digraphs ⋮ `Hubs-repelling' Laplacian and related diffusion on graphs/networks ⋮ On the restricted numerical range of the Laplacian matrix for digraphs
Cites Work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- The eigenvalues of random symmetric matrices
- The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs
- Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems
- On forwarding indices of networks
- Synchronization in networks of nonlinear dynamical systems coupled via a directed graph
- Generalized matrix tree theorem for mixed graphs
- Synchronization in an array of linearly coupled dynamical systems
- Synchronization in coupled arrays of chaotic oscillators with nonreciprocal coupling
This page was built for publication: Algebraic connectivity of directed graphs
