Zero forcing sets and bipartite circulants
From MaRDI portal
Publication:763073
DOI10.1016/J.LAA.2011.09.022zbMATH Open1236.05163arXiv1011.5851OpenAlexW2024581312MaRDI QIDQ763073FDOQ763073
Publication date: 8 March 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1011.5851
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
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Zero forcing sets and the minimum rank of graphs
- Title not available (Why is that?)
- On planarity and colorability of circulant graphs
- Techniques for determining the minimum rank of a small graph
- Zero forcing parameters and minimum rank problems
- An upper bound for the minimum rank of a graph
- The minimum rank of symmetric matrices described by a graph: a survey
Cited In (14)
- On the zero forcing number of a graph involving some classical parameters
- Typical and generic ranks in matrix completion
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
- Upper bounds on the \(k\)-forcing number of a graph
- Computational approaches for zero forcing and related problems
- Complexity and computation of connected zero forcing
- Maximum nullity and zero forcing of circulant graphs
- Some bounds on the zero forcing number of a graph
- Zero forcing number of a graph in terms of the number of pendant vertices
- On tight bounds for the \(k\)-forcing number of a graph
- Bounds on the connected forcing number of a graph
- Reconfiguration graphs of zero forcing sets
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)
