2 research outputs found
Minimum rank and zero forcing number for butterfly networks
The minimum rank of a simple graph is the smallest possible rank over all
symmetric real matrices whose nonzero off-diagonal entries correspond to
the edges of . Using the zero forcing number, we prove that the minimum rank
of the butterfly network is and
that this is equal to the rank of its adjacency matrix