Minimum rank and zero forcing number for butterfly networks
- 209 Downloads
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
Mathematics Subject Classification05C96 05C57 94C15
We would like to thank an anonymous reviewer for carefully reading a previous version of the paper and providing a large number of insightful comments which were incredibly helpful in clarifying the presentation of our arguments.
- AIM Minimum Rank—Special Graphs Work Group, Barioli F, Barrett W, Butle S, Cioabă SM, Cvetković D, Fallat SM, Godsil C, Haemers W, Hogben L, Mikkelson R, Narayan S, Pryporova O, Sciriha I, So W, Stevanović D, van der Holst H, Van der Meulen K, Wangsness A (2008) Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428(7):1628–1648Google Scholar
- Bienstock D (1991) Graph searching, path-width, tree-width and related problems (a survey). In: Roberts FS, Hwang FK, Monma CL (eds) Reliability of computer and communication network. DIMACS series in discrete mathematics and theoretical computer science, vol 5. American Mathematical Society, Providence, pp 33–49Google Scholar
- Fazel M, Hindi H, Boyd S (2004) Rank minimization and applications in system theory. In: Proceedings of the 2004 American control conference, vol 4. IEEE, pp 3273–3278Google Scholar
- Hogben L, Barrett W, Grout J, van der Holst H, Rasmussen K, Smith A (2016) AIM minimum rank graph catalog. http://admin.aimath.org/resources/graph-invariants/minimumrankoffamilies/#/cuig
- Kirousis Lefteris M, Kranakis E, Krizanc D, Stamatiou YC (2000) Locating information with uncertainty in fully interconnected networks. In: International symposium on distributed computing, lecture notes in computer science, vol 1914. Springer, Berlin, pp 283–296Google Scholar