On the zero forcing number of a graph involving some classical parameters
From MaRDI portal
Publication:2292148
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
Cites work
- scientific article; zbMATH DE number 3512165 (Why is no real title available?)
- A lower bound on the zero forcing number
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Bounds on the connected forcing number of a graph
- Complexity and computation of connected zero forcing
- Domination in Graphs Applied to Electric Power Networks
- Dynamic approach to k-forcing
- Extremal \(k\)-forcing sets in oriented graphs
- Extremal values and bounds for the zero forcing number
- Grundy dominating sequences and zero forcing sets
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- Minimum rank and zero forcing number for butterfly networks
- Minimum rank, maximum nullity, and zero forcing number of simple digraphs
- Nondiscriminatory propagation on trees
- On the complexity of the positive semidefinite zero forcing number
- On the total forcing number of a graph
- On zero forcing number of graphs and their complements
- Positive semidefinite propagation time
- Positive semidefinite zero forcing
- Proof of a conjecture on the zero forcing number of a graph
- Restricted power domination and zero forcing problems
- Some bounds on the zero forcing number of a graph
- The relationship between \(k\)-forcing and \(k\)-power domination
- Throttling positive semidefinite zero forcing propagation time on graphs
- Upper bounds on the \(k\)-forcing number of a graph
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Zero forcing and power domination for graph products
- Zero forcing number of a graph in terms of the number of pendant vertices
- Zero forcing number, Grundy domination number, and their variants
- Zero forcing number, constrained matchings and strong structural controllability
- Zero forcing parameters and minimum rank problems
- Zero forcing propagation time on oriented graphs
- Zero forcing sets and bipartite circulants
- Zero forcing sets and the minimum rank of graphs
Cited in
(15)- On the zero forcing number and spectral radius of graphs
- The zero forcing number of graphs with the matching number and the cyclomatic number
- On the relationship between the zero forcing number and path cover number for some graphs
- On the minimum number of distinct eigenvalues of a threshold graph
- Zero forcing number of a graph in terms of the number of pendant vertices
- On graphs maximizing the zero forcing number
- The Zero Forcing Number of Graphs
- A comparison between the zero forcing number and the strong metric dimension of graphs
- On the zero forcing number of graphs and their splitting graphs
- Extremal values and bounds for the zero forcing number
- On the zero forcing number of the complement of graphs with forbidden subgraphs
- Some properties of the closed global shadow graphs and their zero forcing number
- On extremal graphs for zero forcing number
- On trees and unicyclic graphs with equal forcing-type numbers
- 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)
