Controllability of undirected graphs

DOI10.1016/j.laa.2014.04.022zbMath1288.05155OpenAlexW2014691273MaRDI QIDQ2451704

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

eigenvectorscontrollable systemsgraph automorphismscore verticesleaders and followersnetwork dynamical systemsomnicontrollable graphs

Mathematics Subject Classification ID

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

Related Items

On strongly asymmetric and controllable primitive graphs, Controllability of NEPSes of 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 controllability classes for threshold graphs, The impact of graph symmetry on the number of driver nodes in complex networks

Cites Work

• Unnamed Item
• Unnamed Item
• Signless Laplacians of finite graphs
• Graphs with a common eigenvalue deck
• Fast projection methods for minimal design problems in linear system theory
• Controllable subsets in graphs
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective