| Title |
|
Minimum rank and zero forcing number for butterfly networks |
|
|
| Publication Date |
|
| Author(s) |
|
| Type of document |
|
| Language |
|
| Entity Type |
|
| Publisher |
|
| Place of publication |
|
| DOI |
|
10.1007/s10878-018-0335-1 |
|
|
| UNE publication id |
|
| 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. |
|
|
| Link |
|
| Citation |
|
Journal of Combinatorial Optimization, v.37, p. 970-988 |
|
|
| ISSN |
|
| Start page |
|
| End page |
|