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

By Darren D. Row. 2012

98 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/8f6ccafa50bfeecd2366c14b90ac123742fffd14

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Leslie Hogben
2. Shaun M. Fallat
3. Ryan D. Pepper
4. Yair Caro
5. Darren D. Row
6. Samet Oymak
7. Necmiye Ozay

In Computer Networks and Communications

1. Leslie Hogben
2. Ryan D. Pepper
3. Shaun M. Fallat
4. Yair Caro

In Geometry and Topology

1. Leslie Hogben
2. Shaun M. Fallat
3. Ryan D. Pepper
4. Yair Caro
5. Thomas Zaslavsky
6. Samet Oymak
7. Necmiye Ozay

Citations in the corpus

• Minimum Rank, Maximum Nullity, and Zero Forcing Number of Graphs (2014, background): “[Row12] Z(G) = 2 if and only if G is a graph on two parallel paths.”
• Dynamic approach to k-forcing (2014, background): “Some of the many other papers written about zero forcing number are: [2, 4, 6, 7, 8, 9, 10, 11, 13].”