Now showing items 1-1 of 1

    • Bounding the Forcing Number of a Graph 

      Davila, Randy R (2015-04-16)
      The forcing number, denoted F(G), is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the simple graph G. Simple lower and upper bounds are δ ≤ F(G) where δ is the minimum ...