On the error of \textit{a priori} sampling: zero forcing sets and propagation time

DOI10.1016/j.laa.2018.03.031zbMath1416.05111arXiv1709.08740MaRDI QIDQ2002553

Jephian C.-H. Lin, Franklin H. J. Kenter

Publication date: 12 July 2019

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

Full work available at URL: https://arxiv.org/abs/1709.08740

zbMATH Keywords

minimum rank problem; zero forcing; propagation time; error polynomial vector; variance polynomial vector

Mathematics Subject Classification ID

90C27: Combinatorial optimization

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C15: Coloring of graphs and hypergraphs

94C15: Applications of graph theory to circuits and networks

15A03: Vector spaces, linear dependence, rank, lineability

05C57: Games on graphs (graph-theoretic aspects)

Related Items

Throttling for standard zero forcing on directed graphs, Power domination throttling

Uses Software

• OEIS
• Minimum Rank

Cites Work

• Unnamed Item
• Propagation time for zero forcing on a graph
• Positive semidefinite propagation time
• Throttling positive semidefinite zero forcing propagation time on graphs
• Zero forcing sets and the minimum rank of graphs
• Nondiscriminatory propagation on trees
• Topological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked Systems
• The PMU Placement Problem