Abstract: In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties. Notably, we compute upper and lower bounds for the zero forcing number for such a graph based only on the parameters that describe its biadjacency matrix. The main results of the paper characterize the bipartite circulant graphs that achieve equality in the lower bound.
Recommendations
- On the zero forcing number of bijection graphs
- Zero forcing sets and the minimum rank of graphs
- Maximum nullity and zero forcing of circulant graphs
- Zero forcing number, Grundy domination number, and their variants
- On zero forcing number of graphs and their complements
- On the relationships between zero forcing numbers and certain graph coverings
- The Zero Forcing Number of Graphs
- Grundy dominating sequences and zero forcing sets
- On Zero Forcing Number of Permutation Graphs
- Some bounds on the zero forcing number of a graph
Cites work
- scientific article; zbMATH DE number 3650737 (Why is no real title available?)
- An upper bound for the minimum rank of a graph
- On planarity and colorability of circulant graphs
- Techniques for determining the minimum rank of a small graph
- The minimum rank of symmetric matrices described by a graph: a survey
- Zero forcing parameters and minimum rank problems
- Zero forcing sets and the minimum rank of graphs
Cited in
(14)- Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
- Complexity and computation of connected zero forcing
- Maximum nullity and zero forcing of circulant graphs
- Computational approaches for zero forcing and related problems
- On the zero forcing number of a graph involving some classical parameters
- Typical and generic ranks in matrix completion
- Zero forcing number of a graph in terms of the number of pendant vertices
- Bounds on the connected forcing number of a graph
- Reconfiguration graphs of zero forcing sets
- On tight bounds for the \(k\)-forcing number of a graph
- Some bounds on the zero forcing number of a graph
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Upper bounds on the \(k\)-forcing number of a graph
This page was built for publication: Zero forcing sets and bipartite circulants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763073)
