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
AuthorsFerrero, 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.

Keywordszero forcing; minimum rank of graphs; butterfly network
Year2019
JournalJournal of Combinatorial Optimization
Journal citation37 (3), pp. 970-988
PublisherSpringer
ISSN1382-6905
Digital Object Identifier (DOI)https://doi.org/10.1007/s10878-018-0335-1
Scopus EID2-s2.0-85051653452
Page range970-988
Publisher's version
License
All rights reserved
File Access Level
Controlled
Output statusPublished
Publication dates
Online09 Aug 2018
Publication process dates
Deposited29 Nov 2023
Permalink -

https://acuresearchbank.acu.edu.au/item/9002y/minimum-rank-and-zero-forcing-number-for-butterfly-networks

Log in to edit

Restricted files

Publisher's version

  • 18
    total views
  • 0
    total downloads
  • 2
    views this month
  • 0
    downloads this month
These values are for the period from 19th October 2020, when this repository was created.

Export as

Related outputs

Zero forcing in iterated line digraphs
Ferrero, Daniela, Kalinowski, Thomas and Stephen, Sudeep. (2019). Zero forcing in iterated line digraphs. Discrete Applied Mathematics. 255, pp. 198-208. https://doi.org/10.1016/j.dam.2018.08.019
A lower bound on the zero forcing number
Davila, Randy, Kalinowski, Thomas and Stephen, Sudeep. (2018). A lower bound on the zero forcing number. Discrete Applied Mathematics. 250, pp. 363-367. https://doi.org/10.1016/j.dam.2018.04.015
Average distance in interconnection networks via reduction theorems for vertex-weighted graphs
Klavžar, Sandi, Manuel, Paul, Nadjafi-Arani, M. J., Rajan, R. Sundara, Grigorious, Cyriac and Stephen, Sudeep. (2016). Average distance in interconnection networks via reduction theorems for vertex-weighted graphs. The Computer Journal. 59(12), pp. 1900-1910. https://doi.org/10.1093/comjnl/bxw046