Zero forcing number, constrained matchings and strong structural controllability
From MaRDI portal
Publication:491112
DOI10.1016/j.laa.2015.06.025zbMath1325.05057arXiv1405.6222OpenAlexW1669520380MaRDI QIDQ491112
Maguy Trefois, Jean-Charles Delvenne
Publication date: 24 August 2015
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6222
Trees (05C05) Controllability (93B05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (30)
An overview of structural systems theory ⋮ Computational approaches for zero forcing and related problems ⋮ Extremal values and bounds for the zero forcing number ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Total forcing sets and zero forcing sets in trees ⋮ Constructing a controllable graph under edge constraints ⋮ Some properties of the closed global shadow graphs and their zero forcing number ⋮ Topological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked Systems ⋮ Some bounds on the zero forcing number of a graph ⋮ On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme ⋮ Bounding the total forcing number of graphs ⋮ Unnamed Item ⋮ Zero forcing in iterated line digraphs ⋮ On the total forcing number of a graph ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Optimal regulation of flow networks with transient constraints ⋮ The forcing number of graphs with given girth ⋮ Strong structural controllability of colored structured systems ⋮ Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms ⋮ Bounds on the connected forcing number of a graph ⋮ Zero forcing propagation time on oriented graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ Complexity and computation of connected zero forcing ⋮ Zero forcing versus domination in cubic graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Zero forcing in claw-free cubic graphs ⋮ Strong structural controllability of networks: comparison of bounds using distances and zero forcing
Cites Work
- Unnamed Item
- Minimum rank problems
- The minimum rank of symmetric matrices described by a graph: a survey
- Qualitative controllability and uncontrollability by a single entry
- Zero forcing sets and the minimum rank of graphs
- On the Maximum Uniquely Restricted Matching for Bipartite Graphs
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
- On the minimum rank of not necessarily symmetric matrices: A preliminary study
- Strong Structural Controllability
- Ranks of zero patterns and sign patterns*
- Structural controllability
- Reducibility among Combinatorial Problems
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- On the Reachability and Observability of Path and Cycle Graphs
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- On the Controllability Properties of Circulant Networks
- Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
- Uniquely restricted matchings
This page was built for publication: Zero forcing number, constrained matchings and strong structural controllability
