Laplacian controllability classes for threshold graphs

DOI10.1016/j.laa.2015.01.020zbMath1307.05135OpenAlexW2005270743MaRDI QIDQ2261563

Bahman Gharesifard, Cesar O. Aguilar

Publication date: 6 March 2015

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

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

zbMATH Keywords

controllabilitythreshold graphsLaplacian dynamics

Mathematics Subject Classification ID

Applications of graph theory (05C90) Controllability (93B05) Linear systems in control theory (93C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (11)

Group controllability of discrete-time multi-agent systems ⋮ Controllability of NEPSes of graphs ⋮ Almost equitable partitions and new necessary conditions for network controllability ⋮ Constructing a controllable graph under edge constraints ⋮ On a Conjecture of Godsil Concerning Controllable Random Graphs ⋮ Unnamed Item ⋮ Net Laplacian controllability for joins of signed graphs ⋮ Laplacian controllability for graphs with integral Laplacian spectrum ⋮ Laplacian controllability for graphs obtained by some standard products ⋮ Eigenvectors and controllability of non-Hermitian random matrices and directed graphs ⋮ Group controllability of discrete-time time-delayed multiagent systems with multiple leaders

Cites Work

• Unnamed Item
• Unnamed Item
• Leaders in multi-agent controllability under consensus algorithm and tree topology
• Interconnection topologies for multi-agent coordination under leader-follower framework
• Laplacian graph eigenvectors
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Laplacian spectra and spanning trees of threshold graphs
• Controllable subsets in graphs
• Controllability of undirected graphs
• Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Consensus and Cooperation in Networked Multi-Agent Systems
• Controllable graphs with least eigenvalue at least -2
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• On the Reachability and Observability of Path and Cycle Graphs
• Controllability and Observability of Grid Graphs via Reduction and Symmetries

This page was built for publication: Laplacian controllability classes for threshold graphs