- Title
- Minimum rank and zero forcing number for butterfly networks
- Creator
- Ferrero, Daniela; Grigorious, Cyriac; Kalinowski, Thomas; Ryan, Joe; Stephen, Sudeep
- Relation
- Journal of Combinatorial Optimization Vol. 37, Issue 3, p. 970-988
- Publisher Link
- http://dx.doi.org/10.1007/s10878-018-0335-1
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2019
- Description
- 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.
- Subject
- zero forcing; minimum rank of graphs; butterfly network; graph propagation
- Identifier
- http://hdl.handle.net/1959.13/1406762
- Identifier
- uon:35653
- Identifier
- ISSN:1382-6905
- Rights
- This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: https://doi.org/10.1007/s10878-018-0335-1
- Language
- eng
- Full Text
- Reviewed
- Hits: 1909
- Visitors: 2215
- Downloads: 315
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | ATTACHMENT02 | Author final version | 776 KB | Adobe Acrobat PDF | View Details Download |