Minimum rank and zero forcing number for butterfly networks
Journal article
Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe and Stephen, Sudeep. (2019). Minimum rank and zero forcing number for butterfly networks. Journal of Combinatorial Optimization. 37(3), pp. 970-988. https://doi.org/10.1007/s10878-018-0335-1
Authors | Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe and Stephen, Sudeep |
---|---|
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. |
Keywords | zero forcing; minimum rank of graphs; butterfly network |
Year | 2019 |
Journal | Journal of Combinatorial Optimization |
Journal citation | 37 (3), pp. 970-988 |
Publisher | Springer |
ISSN | 1382-6905 |
Digital Object Identifier (DOI) | https://doi.org/10.1007/s10878-018-0335-1 |
Scopus EID | 2-s2.0-85051653452 |
Page range | 970-988 |
Publisher's version | License All rights reserved File Access Level Controlled |
Output status | Published |
Publication dates | |
Online | 09 Aug 2018 |
Publication process dates | |
Deposited | 29 Nov 2023 |
Permalink -
https://acuresearchbank.acu.edu.au/item/9002y/minimum-rank-and-zero-forcing-number-for-butterfly-networks
Restricted files
Publisher's version
(1 files)
25
total views0
total downloads0
views this month0
downloads this month