Controllability of undirected graphs

DOI10.1016/J.LAA.2014.04.022MaRDI QIDQ2451704zbMATH OpenOpenAlexFDO

Authors Alexander Farrugia, Irene Sciriha

Publication date 4 June 2014

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2014.04.022

zbMATH Keywords

controllable systemscore verticeseigenvectorsgraph automorphismsleaders and followersnetwork dynamical systemsomnicontrollable graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Control problems involving ordinary differential equations (34H05) Dynamical systems in control (37N35) Applications of operator theory in systems, signals, circuits, and control theory (47N70) Controllability (93B05) Control/observation systems governed by ordinary differential equations (93C15)

Recommendations

• Almost equitable partitions and new necessary conditions for network controllability
• Controllability of multi-agent systems from a graph-theoretic perspective
• Controllability of weighted and directed networks with nonidentical node dynamics
• Further results on controllable graphs
• Graph-theoretic characterization of controllability for multi-agent systems

Cites work

• Controllability of multi-agent systems from a graph-theoretic perspective
• Controllable graphs
• Controllable subsets in graphs
• Eigenspaces of graphs
• Fast projection methods for minimal design problems in linear system theory
• Graphs with a common eigenvalue deck
• Signless Laplacians of finite graphs

Cited in

(23)

• Constructing a controllable graph under edge constraints
• Linear control of live marked graphs
• The impact of graph symmetry on the number of driver nodes in complex networks
• The controllability Gramian of lattice graphs
• Laplacian controllability for graphs with integral Laplacian spectrum
• Laplacian controllability classes for threshold graphs
• Almost equitable partitions and new necessary conditions for network controllability
• On a Conjecture of Godsil Concerning Controllable Random Graphs
• Controllability and matchings in random bipartite graphs
• On strongly asymmetric and controllable primitive graphs
• Control of Some Graph Invariants in Dynamic Routing
• scientific article; zbMATH DE number 1182741 (Why is no real title available?)
• On the construction of Q-controllable graphs
• Controlling consensus in networks with symmetries
• Controllability of NEPSes of graphs
• Controllability of certain real symmetric matrices with application to controllability of graphs
• Controllability of multi-agent systems based on automorphism and leader symmetry
• Minimal Laplacian controllability problems of threshold graphs
• Using permuted graph bases in \(\mathcal{H}_\infty\) control
• Further results on almost controllable graphs
• Strong star complements in graphs
• The Smith normal form of the walk matrix of the Dynkin graph \(D_n\) for \(n \equiv 0 \pmod{4}\)
• Laplacian controllable graphs based on connecting two antiregular graphs

This page was built for publication: Controllability of undirected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2451704)