Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis
From MaRDI portal
Structural characterization of families of graphs (05C75) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Applications of graph theory (05C90) Miscellaneous inequalities involving matrices (15A45) Decentralized systems (93A14) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)
Recommendations
- Stabilizing non-diagonalizable networks
- scientific article; zbMATH DE number 3933235
- Stability of circulant graphs
- Stability results for graphs with a critical edge
- Stability in CAN-free graphs
- Stability of networks in stretchable graphs
- A note on stability of graphs
- Stability of graphs
- Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
- Graph homology and stability of coupled oscillator networks
Cited in
(10)- Extension of diagonal stability and stabilization for continuous-time fractional positive linear systems
- Stability of matrix polytopes with a dominant vertex and implications for system dynamics
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs
- Sufficient conditions for Schur and Hurwitz diagonal stability of complex interval matrices
- Stability and stabilisation of a class of networked dynamic systems
- Graph-theoretic stability conditions for Metzler matrices and monotone systems
- Unifying matrix stability concepts with a view to applications
- Stability of ecological systems: a theoretical review
- Degree realization by bipartite cactus graphs
- Degree realization by bipartite cactus graphs
This page was built for publication: Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347912)
