论文信息 - Properties of the Zero Forcing Number

Properties of the Zero Forcing Number

PROPERTIES OF THE ZERO FORCING NUMBER Kayla Owens Department of Mathematics Master of Science The zero forcing number is a graph parameter first introduced as a tool for solving the minimum rank problem, which is: Given a simple, undirected graph G, and a field F , let S(F,G) denote the set of all symmetric matrices A = [aij ] with entries in F such that aij 6= 0 if and only if ij is an edge in G. Find the minimum possible rank of a matrix in S(F,G). It is known that the zero forcing number Z(G) provides an upper bound for the maximum nullity of a graph. I investigate properties of the zero forcing number, including its behavior under various graph operations.

Kayla Denise Owens | K. Owens

[1] Raphael Loewy,et al. The minimum rank problem over the finite field of order 2 : Minimum rank 3 , 2006 .

[2] H. Holst. The maximum corank of graphs with a 2-separation , 2008 .

[3] K. Roberts,et al. Thesis , 2002 .

[4] Koji Maruyama,et al. Indirect Hamiltonian identification through a small gateway , 2009, 0903.0612.

[5] Shaun M. Fallat,et al. Computation of minimal rank and path cover number for certain graphs , 2004 .

[6] Vittorio Giovannetti,et al. Full control by locally induced relaxation. , 2007, Physical review letters.

[7] Charles R. Johnson,et al. The graphs for which the maximum multiplicity of an eigenvalue is two , 2007, math/0701562.

[8] A. Karimi,et al. Master‟s thesis , 2011 .

[9] Shaun M. Fallat,et al. The minimum rank of symmetric matrices described by a graph: A survey☆ , 2007 .