A technique for computing the zero forcing number of a graph with a cut-vertex

作者：Row Darren D^*

来源：Linear Algebra and Its Applications, 2012, 436(12): 4423-4432.

DOI：10.1016/j.laa.2011.05.012

• Zero forcing number
• Zero spread
• Maximum nullity
• Cut-vertex reduction
• Unicyclic graphs

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.

• 出版日期2012-6-15