Minimum rank and zero forcing number for butterfly networks

Daniela Ferrero (), Cyriac Grigorious (), Thomas Kalinowski (), Joe Ryan () and Sudeep Stephen ()
Additional contact information
Daniela Ferrero: Texas State University
Cyriac Grigorious: University of Newcastle
Thomas Kalinowski: University of Newcastle
Joe Ryan: University of Newcastle
Sudeep Stephen: University of Newcastle

Journal of Combinatorial Optimization, 2019, vol. 37, issue 3, No 11, 970-988

Abstract: 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; 05C96; 05C57; 94C15 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0335-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:37:y:2019:i:3:d:10.1007_s10878-018-0335-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0335-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().