Pages that link to "Item:Q491112"
From MaRDI portal
The following pages link to Zero forcing number, constrained matchings and strong structural controllability (Q491112):
Displaying 30 items.
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Constructing a controllable graph under edge constraints (Q1680674) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- Optimal regulation of flow networks with transient constraints (Q1737918) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms (Q1996663) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- Strong structural controllability of networks: comparison of bounds using distances and zero forcing (Q2097717) (← links)
- An overview of structural systems theory (Q2125521) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- Strong structural controllability of colored structured systems (Q2243018) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
- Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
- Topological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked Systems (Q4596855) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- (Q5028519) (← links)
- Improved Computational Approaches and Heuristics for Zero Forcing (Q5084604) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
