On extremal graphs for zero forcing number
For a graph \(G\) with \(S\subseteq V(G)\), \(S\) is a zero forcing set of \(G\) if iteratively adding vertices to \(S\) from \(V(G)\setminus S\) that are the unique neighbor in \(V(G)\setminus S\) of some vertex in \(S\), results in the entire \(V(G)\) of \(G\). The zero (resp., connected) forcing number, denoted by \(F(G)\) (resp., \(F_c(G)\)), of a graph \(G\) is the minimum cardinality of a zero (resp., connected) forcing set of \(G\). In this paper, some upper bounds on \(F(G)\) and \(F_c(G)\) are obtained in terms of the order and the girth of a graph \(G\), and the corresponding extremal graphs are also characterized.
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- A technique for computing the zero forcing number of a graph with a cut-vertex
- An upper bound for the minimum rank of a graph
- Approximating the minimum rank of a graph via alternating projection
- Blocking zero forcing processes in Cartesian products of graphs
- 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
- Computation of minimal rank and path cover number for certain graphs
- Extremal values and bounds for the zero forcing number
- Graphs whose minimal rank is two
- Logic circuits from zero forcing
- Lower bounds in minimum rank problems
- Maximum nullity and zero forcing number on graphs with maximum degree at most three
- Non-separating induced cycles in graphs
- On connected graphs of order n with girth g and nullity n-g
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- On the nullity of graphs
- On the total forcing number of a graph
- On the zero forcing number of a graph involving some classical parameters
- Orthogonal representations, minimum rank, and graph complements
- Proof of a conjecture on the zero forcing number of a graph
- Some bounds on the zero forcing number of a graph
- The graphs for which the maximum multiplicity of an eigenvalue is two
- The minimum rank of symmetric matrices described by a graph: a survey
- Upper bounds on the \(k\)-forcing number of a graph
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
- Zero forcing sets and the minimum rank of graphs
- Extremal graph theory and finite forcibility
- Some bounds on the zero forcing number of a graph
- Bounds on the connected forcing number of a graph
- Zero-forcing in random regular graphs
- Extremal k-forcing sets in oriented graphs
- Zero forcing in triangulations
- Three-state zero forcing on graphs
- Proof of a conjecture on the zero forcing number of a graph
- On Zero Forcing Number of Permutation Graphs
- Extremal values and bounds for the zero forcing number
- The Zero Forcing Number of Graphs
- The forcing number of graphs with given girth
- Zero forcing number of a graph in terms of the number of pendant vertices
- Connected zero forcing sets and connected propagation time of graphs
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs
- On graphs maximizing the zero forcing number
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Minimal zero forcing sets
- An approximation algorithm for zero forcing
- The extremal results for forcing problem of trees
- Semitotal forcing in claw-free cubic graphs
- The zero forcing number of expanded paths and cycles
This page was built for publication: On extremal graphs for zero forcing number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102756)
