Generalising Laplacian controllability of paths
From MaRDI portal
Cites work
- A necessary and sufficient condition for the controllability of single-leader multi-chain systems
- Antiregular graphs are universal for trees
- Applications of combinatorial matrix theory to Laplacian matrices of graphs
- Constructing a controllable graph under edge constraints
- Controllability and Observability of Grid Graphs via Reduction and Symmetries
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
- Degree maximal graphs are Laplacian integral
- Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
- Graph theoretic methods in multiagent networks
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
- Laplacian controllability classes for threshold graphs
- Laplacian controllable graphs based on connecting two antiregular graphs
- Laplacian graph eigenvectors
- Minimal Controllability Problems
- On the adjacency matrix of a threshold graph
- On the Controllability Properties of Circulant Networks
- On the Reachability and Observability of Path and Cycle Graphs
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
This page was built for publication: Generalising Laplacian controllability of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025281)
