Minimum rank and zero forcing number for butterfly networks

Author(s)
Ferrero, Daniela
Grigorious, Cyriac
Kalinowski, Thomas
Ryan, Joe
Stephen, Sudeep
Publication Date
2019
Abstract
Zero forcing is a graph propagation process introduced in quantum physics and theoretical computer science, and closely related to the minimum rank problem. The minimum rank of a graph is the smallest possible rank over all matrices described by a given network. We use this relationship to determine the minimum rank and the zero forcing number of butterfly networks, concluding they present optimal properties in regards to both problems.
Citation
Journal of Combinatorial Optimization, v.37, p. 970-988
ISSN
1573-2886
1382-6905
Link
https://hdl.handle.net/1959.11/26328
Publisher
Springer New York LLC
Title
Minimum rank and zero forcing number for butterfly networks
Type of document
Journal Article
Entity Type
Publication

Files:

NameSizeformatDescriptionLink