On the zero forcing number of a graph involving some classical parameters
DOI10.1007/S10878-019-00475-1zbMATH Open1434.05113OpenAlexW2985340552WikidataQ126832159 ScholiaQ126832159MaRDI QIDQ2292148FDOQ2292148
Publication date: 3 February 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00475-1
Recommendations
- Zero forcing number of a graph in terms of the number of pendant vertices
- Extremal values and bounds for the zero forcing number
- On zero forcing number of graphs and their complements
- The zero forcing number of graphs with the matching number and the cyclomatic number
- On minimum rank and zero forcing sets of a graph
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Domination in Graphs Applied to Electric Power Networks
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Zero forcing parameters and minimum rank problems
- Some bounds on the zero forcing number of a graph
- Positive semidefinite zero forcing
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Nondiscriminatory propagation on trees
- Title not available (Why is that?)
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
- On zero forcing number of graphs and their complements
- On the complexity of the positive semidefinite zero forcing number
- Zero forcing sets and bipartite circulants
- Positive semidefinite propagation time
- Minimum rank, maximum nullity, and zero forcing number of simple digraphs
- On the total forcing number of a graph
- Zero forcing propagation time on oriented graphs
- Throttling positive semidefinite zero forcing propagation time on graphs
- Restricted power domination and zero forcing problems
- Complexity and computation of connected zero forcing
- Zero forcing number, Grundy domination number, and their variants
- Grundy dominating sequences and zero forcing sets
- Bounds on the connected forcing number of a graph
- Title not available (Why is that?)
- Extremal \(k\)-forcing sets in oriented graphs
- A lower bound on the zero forcing number
- The relationship between \(k\)-forcing and \(k\)-power domination
- Minimum rank and zero forcing number for butterfly networks
- Zero forcing number of a graph in terms of the number of pendant vertices
Cited In (7)
- The zero forcing number of graphs with the matching number and the cyclomatic number
- The Zero Forcing Number of Graphs
- On the minimum number of distinct eigenvalues of a threshold graph
- On trees and unicyclic graphs with equal forcing-type numbers
- On graphs maximizing the zero forcing number
- On extremal graphs for zero forcing number
- The \(q\)-analogue of zero forcing for certain families of graphs
This page was built for publication: On the zero forcing number of a graph involving some classical parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292148)
