On tight bounds for the \(k\)-forcing number of a graph
From MaRDI portal
Publication:2421385
DOI10.1007/s40840-017-0507-7zbMath1414.05125OpenAlexW2617188003MaRDI QIDQ2421385
Lily Chen, Yan Zhao, Hengzhe Li
Publication date: 17 June 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-017-0507-7
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing sets and bipartite circulants
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph