Minimum rank and zero forcing number for butterfly networks

Daniela Ferrero; Cyriac Grigorious; Thomas Kalinowski; Joe Ryan; Sudeep Stephen

doi:10.1007/s10878-018-0335-1

Minimum rank and zero forcing number for butterfly networks

Daniela Ferrero
, Cyriac Grigorious
, Thomas Kalinowski
, Joe Ryan
, Sudeep Stephen

School of Science & Technology

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

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.

Original language	English
Pages (from-to)	970-988
Journal	Journal of Combinatorial Optimization
Volume	37
Early online date	9 Aug 2018
DOIs	https://doi.org/10.1007/s10878-018-0335-1
Publication status	Published - 2019

Keywords

Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)

Access to Document

10.1007/s10878-018-0335-1

https://hdl.handle.net/1959.11/26328

Handle.net

Persistent link

Cite this

@article{9ab8b857f0f94893b032ac24001b16d8,

title = "Minimum rank and zero forcing number for butterfly networks",

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 = "Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)",

author = "Daniela Ferrero and Cyriac Grigorious and Thomas Kalinowski and Joe Ryan and Sudeep Stephen",

year = "2019",

doi = "10.1007/s10878-018-0335-1",

language = "English",

volume = "37",

pages = "970--988",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer New York LLC",

}

TY - JOUR

T1 - Minimum rank and zero forcing number for butterfly networks

AU - Ferrero, Daniela

AU - Grigorious, Cyriac

AU - Kalinowski, Thomas

AU - Ryan, Joe

AU - Stephen, Sudeep

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Combinatorics and Discrete Mathematics (excl. Physical Combinatorics)

U2 - 10.1007/s10878-018-0335-1

DO - 10.1007/s10878-018-0335-1

M3 - Article

SN - 1382-6905

VL - 37

SP - 970

EP - 988

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

ER -

Minimum rank and zero forcing number for butterfly networks

Abstract

Keywords

Access to Document

Handle.net

Fingerprint

Cite this