Mathematics – Combinatorics
Scientific paper
2010-11-26
Mathematics
Combinatorics
22 pages, 13 figures
Scientific paper
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.
No associations
LandOfFree
Zero Forcing Sets and Bipartite Circulants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Zero Forcing Sets and Bipartite Circulants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zero Forcing Sets and Bipartite Circulants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-463357