Loading...
Minimum rank and zero forcing number for butterfly networks
Ferrero, Daniela Grigorious, Cyriac Kalinowski, Thomas Ryan, Joe Stephen, Sudeep
Ferrero, Daniela
Grigorious, Cyriac
Kalinowski, Thomas
Ryan, Joe
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
Date
2019
Type
Journal article
Journal
Journal of Combinatorial Optimization
Book
Volume
37
Issue
3
Page Range
970-988
Article Number
ACU Department
School of Arts and Humanities
Faculty of Education and Arts
Faculty of Education and Arts
Collections
Relation URI
Source URL
Event URL
Open Access Status
License
All rights reserved
File Access
Controlled