On zero forcing number of graphs and their complements

DOI10.1142/S1793830915500020zbMath1312.05079arXiv1402.1962MaRDI QIDQ5245854

Eunjeong Yi, Cong X. Kang, Linda Eroh

Publication date: 15 April 2015

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

zero forcing number; zero forcing set

Mathematics Subject Classification ID

05C05: Trees

05C38: Paths and cycles

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

05D99: Extremal combinatorics

Related Items

Proof of a conjecture on the zero forcing number of a graph, Failed skew zero forcing on a graph, On the zero forcing number of a graph involving some classical parameters, A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs

Cites Work

• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Propagation time for zero forcing on a graph
• On the minimum rank of a graph over finite fields
• An upper bound for the minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• Complement reducible graphs
• Resolvability in graphs and the metric dimension of a graph
• Zero forcing sets and the minimum rank of graphs
• On Complementary Graphs
• Nondiscriminatory propagation on trees
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph