论文信息 - Dynamic approach to k-forcing

Dynamic approach to k-forcing

The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from a recent paper of Amos, Caro, Davila and Pepper [2], while also answering an open problem posed by Meyer [9].

Yair Caro | Ryan Pepper | Y. Caro | R. Pepper

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

[2] Sarah Meyer,et al. Propagation time for zero forcing on a graph , 2012, Discret. Appl. Math..

[3] Nathaniel Dean,et al. Iteration Index of a Zero Forcing Set in a Graph , 2011, 1105.1492.

[4] Leslie Hogben,et al. Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph , 2012 .

[5] Yair Caro,et al. Upper bounds on the k-forcing number of a graph , 2014, Discret. Appl. Math..

[6] Darren D. Row. Zero forcing number: Results for computation and comparison with other graph parameters , 2011 .

[7] Linda Eroh,et al. Metric dimension and zero forcing number of two families of line graphs , 2012, 1207.6127.

[8] Seth A. Meyer. Zero forcing sets and bipartite circulants , 2010 .

[9] Fred S. Roberts,et al. Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion , 2009, Discret. Appl. Math..

[10] Darren D. Row. A technique for computing the zero forcing number of a graph with a cut-vertex , 2012 .

[11] Eunjeong Yi,et al. On Zero Forcing Number of Permutation Graphs , 2012, COCOA.

[12] W. Haemers. Zero forcing sets and minimum rank of graphs , 2008 .