Proof of a conjecture on the zero forcing number of a graph

DOI10.1016/j.dam.2016.05.009zbMath1344.05063arXiv1507.01364OpenAlexW2963359456WikidataQ123111265 ScholiaQ123111265MaRDI QIDQ313827

Baoyindureng Wu, Zixing Tang, Leihao Lu

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

ranknullityzero forcing numberzero forcing set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (18)

Computational approaches for zero forcing and related problems ⋮ Total forcing sets and zero forcing sets in trees ⋮ Some bounds on the zero forcing number of a graph ⋮ UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS ⋮ On graphs maximizing the zero forcing number ⋮ On the total forcing number of a graph ⋮ On the nullity of a connected graph in terms of order and maximum degree ⋮ 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 ⋮ Maximum nullity and zero forcing number of graphs with rank at most 4 ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ A lower bound on the zero forcing number ⋮ Matching, path covers, and total forcing sets ⋮ Zero forcing in claw-free cubic graphs ⋮ On extremal graphs for zero forcing number

Cites Work

• Unnamed Item
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Propagation time for zero forcing on a graph
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing sets and bipartite circulants
• 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
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Zero forcing sets and the minimum rank of graphs
• Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
• Dynamic approach to k-forcing
• On zero forcing number of graphs and their complements

This page was built for publication: Proof of a conjecture on the zero forcing number of a graph