Minimum rank and zero forcing number for butterfly networks

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2

The minimum rank of a simple graph $G$ is the smallest possible rank over all symmetric real matrices $A$ whose nonzero off-diagonal entries correspond to the edges of $G$. Using t…