Open AccessZero forcing number: Results for computation and comparison with other graph parameters
Author(s) -
Darren D. Row
Publication year - 2011
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.31274/etd-180810-76
Subject(s) - mathematics , forcing (mathematics) , zero (linguistics) , vertex (graph theory) , combinatorics , graph , computation , discrete mathematics , algorithm , mathematical analysis , philosophy , linguistics
The zero forcing number of a graph is the minimum size of a zero forcing set. This parameter is useful in the minimum rank/maximum nullity problem, as it gives an upper bound to the maximum nullity. Results for determining graphs with extreme zero forcing numbers, for determining the zero forcing number of graphs with a cut-vertex, and for determining the zero forcing number of unicyclic graphs are presented.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom