Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges

DOI10.1109/TCNS.2015.2503561zbMath1370.05141OpenAlexW2344056755MaRDI QIDQ5358549

Norikazu Takahashi, Tatsuya Fukami, Kohnosuke Ogiwara

Publication date: 21 September 2017

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcns.2015.2503561

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (9)

The algebraic connectivity of graphs with given circumference ⋮ Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems ⋮ Event-triggered robust cooperative stabilization in nonlinearly interconnected multiagent systems ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ Band-restricted diagonally dominant matrices: computational complexity and application ⋮ Fast consensus seeking on networks with antagonistic interactions ⋮ ROBUST FIXED-TIME CONSENSUS PROTOCOLS FOR MULTI-AGENT SYSTEMS WITH NONLINEAR STATE MEASUREMENTS ⋮ FURTHER IMPROVEMENT OF FINITE-TIME CONSENSUS PROTOCOLS FOR DETAIL-BALANCED NETWORKS ⋮ On minimum algebraic connectivity of graphs whose complements are bicyclic

This page was built for publication: Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges