Maximum nullity and zero forcing of circulant graphs
The zero forcing number of a graph has been applied to communication complexity, electrical power grid monitoring, and some inverse eigenvalue problems. It is well-known that the zero forcing number of a graph provides a lower bound on the minimum rank of a graph. In this paper we bound and characte...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2020-12-01
|
| Series: | Special Matrices |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/spma-2020-0106 |