maximum arc digraph with a given zero forcing number · combinatorial matrix theory (isu) october...
TRANSCRIPT
![Page 1: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/1.jpg)
Maximum Arc Digraph with aGiven Zero Forcing Number
Cora Brown, Nathanael Cox
Iowa State UniversityAmes, IA 50011
October 29, 2013
![Page 2: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/2.jpg)
Introduction
1
2
3 4An example of a digraph
A digraph Γ = (V ,E), is a vertex set, V , and an arc set of orderedpairs, E, where (u, v) ∈ E(Γ) if u, v ∈ V(Γ) and there exists an arc in Γ
that points from u to v.
Combinatorial Matrix Theory (ISU) October 2013 2 / 20
![Page 3: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/3.jpg)
Matrices for Digraphs
1
2
3 4
? 0 ∗ ∗∗ ? ∗ 00 ∗ ? 0∗ ∗ 0 ?
1 0 1 23 5 8 00 13 0 0
21 34 0 55
Combinatorial Matrix Theory (ISU) October 2013 3 / 20
![Page 4: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/4.jpg)
The minimum rank of a digraph Γ is defined asmr(Γ) = min{rank (A) : A ∈M(Γ)}.
The maximum nullity of a digraph Γ is defined asM(Γ) = max{null(A) : A ∈M(Γ)}.
TheoremFor any digraph Γ , M(Γ) + mr(Γ) = |Γ |.
TheoremFor any digraph Γ , mr(Γ) , n and M(Γ) , 0.
Combinatorial Matrix Theory (ISU) October 2013 4 / 20
![Page 5: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/5.jpg)
The minimum rank of a digraph Γ is defined asmr(Γ) = min{rank (A) : A ∈M(Γ)}.
The maximum nullity of a digraph Γ is defined asM(Γ) = max{null(A) : A ∈M(Γ)}.
TheoremFor any digraph Γ , M(Γ) + mr(Γ) = |Γ |.
TheoremFor any digraph Γ , mr(Γ) , n and M(Γ) , 0.
Combinatorial Matrix Theory (ISU) October 2013 4 / 20
![Page 6: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/6.jpg)
The minimum rank of a digraph Γ is defined asmr(Γ) = min{rank (A) : A ∈M(Γ)}.
The maximum nullity of a digraph Γ is defined asM(Γ) = max{null(A) : A ∈M(Γ)}.
TheoremFor any digraph Γ , M(Γ) + mr(Γ) = |Γ |.
TheoremFor any digraph Γ , mr(Γ) , n and M(Γ) , 0.
Combinatorial Matrix Theory (ISU) October 2013 4 / 20
![Page 7: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/7.jpg)
The minimum rank of a digraph Γ is defined asmr(Γ) = min{rank (A) : A ∈M(Γ)}.
The maximum nullity of a digraph Γ is defined asM(Γ) = max{null(A) : A ∈M(Γ)}.
TheoremFor any digraph Γ , M(Γ) + mr(Γ) = |Γ |.
TheoremFor any digraph Γ , mr(Γ) , n and M(Γ) , 0.
Combinatorial Matrix Theory (ISU) October 2013 4 / 20
![Page 8: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/8.jpg)
The minimum rank of a digraph Γ is defined asmr(Γ) = min{rank (A) : A ∈M(Γ)}.
The maximum nullity of a digraph Γ is defined asM(Γ) = max{null(A) : A ∈M(Γ)}.
TheoremFor any digraph Γ , M(Γ) + mr(Γ) = |Γ |.
TheoremFor any digraph Γ , mr(Γ) , n and M(Γ) , 0.
Combinatorial Matrix Theory (ISU) October 2013 4 / 20
![Page 9: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/9.jpg)
The color change rule for digraphs states that given a blue vertex band a white vertex w, b forces w to turn blue if w is the only whiteout-neighbor of b.
b wb cannot force w
b wb can force w
Combinatorial Matrix Theory (ISU) October 2013 5 / 20
![Page 10: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/10.jpg)
The color change rule for digraphs states that given a blue vertex band a white vertex w, b forces w to turn blue if w is the only whiteout-neighbor of b.
b wb cannot force w
b wb can force w
Combinatorial Matrix Theory (ISU) October 2013 5 / 20
![Page 11: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/11.jpg)
The color change rule for digraphs states that given a blue vertex band a white vertex w, b forces w to turn blue if w is the only whiteout-neighbor of b.
b wb cannot force w
b wb can force w
Combinatorial Matrix Theory (ISU) October 2013 5 / 20
![Page 12: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/12.jpg)
The zero forcing number, Z(Γ), is the minimum number of vertices thatneed to be colored blue in order to force the rest of the graph to be
colored blue through the color change rule.
For any digraph Γ , M(Γ) 6 Z(Γ) (Barioli et al., 2008)(Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 6 / 20
![Page 13: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/13.jpg)
The zero forcing number, Z(Γ), is the minimum number of vertices thatneed to be colored blue in order to force the rest of the graph to be
colored blue through the color change rule.
For any digraph Γ , M(Γ) 6 Z(Γ) (Barioli et al., 2008)(Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 6 / 20
![Page 14: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/14.jpg)
The zero forcing number, Z(Γ), is the minimum number of vertices thatneed to be colored blue in order to force the rest of the graph to be
colored blue through the color change rule.
For any digraph Γ , M(Γ) 6 Z(Γ) (Barioli et al., 2008)(Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 6 / 20
![Page 15: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/15.jpg)
The zero forcing number, Z(Γ), is the minimum number of vertices thatneed to be colored blue in order to force the rest of the graph to be
colored blue through the color change rule.
For any digraph Γ , M(Γ) 6 Z(Γ) (Barioli et al., 2008)(Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 6 / 20
![Page 16: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/16.jpg)
Given a zero forcing set and a corresponding chronological list offorces, a backward arc is any arc (u, v) ∈ E(Γ) such that v is forcedbefore u. A forward arc is any arc that is not a backward arc.
4 5
2
3
1
Combinatorial Matrix Theory (ISU) October 2013 7 / 20
![Page 17: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/17.jpg)
Hessenberg Paths
A path (v1, ..., vk ) in a digraph Γ is Hessenberg if it is a path that doesnot contain any arc of the form (vi , vj) with j > i + 1.
A Hessenberg Path
Adding an illegal arc
Theorem (Hogben, 2010)
Z(Γ) = 1 if and only if Γ is a Hessenberg path.
Combinatorial Matrix Theory (ISU) October 2013 8 / 20
![Page 18: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/18.jpg)
Path Cover
A path cover of Γ is a set of vertex disjoint Hessenberg paths thatincludes all vertices of Γ .
The path cover number, P(Γ), is the minimum number of paths ina path cover for Γ .
a path cover for Γ with P(Γ) = 2
For any digraph Γ , P(Γ) 6 Z(Γ) (Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 9 / 20
![Page 19: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/19.jpg)
Path Cover
A path cover of Γ is a set of vertex disjoint Hessenberg paths thatincludes all vertices of Γ .The path cover number, P(Γ), is the minimum number of paths ina path cover for Γ .
a path cover for Γ with P(Γ) = 2
For any digraph Γ , P(Γ) 6 Z(Γ) (Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 9 / 20
![Page 20: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/20.jpg)
Path Cover
A path cover of Γ is a set of vertex disjoint Hessenberg paths thatincludes all vertices of Γ .The path cover number, P(Γ), is the minimum number of paths ina path cover for Γ .
a path cover for Γ with P(Γ) = 2
For any digraph Γ , P(Γ) 6 Z(Γ) (Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 9 / 20
![Page 21: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/21.jpg)
Path Cover
A path cover of Γ is a set of vertex disjoint Hessenberg paths thatincludes all vertices of Γ .The path cover number, P(Γ), is the minimum number of paths ina path cover for Γ .
a path cover for Γ with P(Γ) = 2
For any digraph Γ , P(Γ) 6 Z(Γ) (Hogben, 2010).
Combinatorial Matrix Theory (ISU) October 2013 9 / 20
![Page 22: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/22.jpg)
Digraph of two parallel Hessenberg paths
A Parallel HessenbergPath
Adding an illegal arc
Combinatorial Matrix Theory (ISU) October 2013 10 / 20
![Page 23: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/23.jpg)
Important Theorems
Theorem (Berliner et al., Under Review)
Z(Γ) = 2 if and only if Γ is a digraph of two parallel Hessenberg paths.
Theorem (Hogben, 2010)Suppose Γ is a digraph and F is a chronological list of forces of a zeroforcing set B. A maximal forcing chain is a Hessenberg path.
Combinatorial Matrix Theory (ISU) October 2013 11 / 20
![Page 24: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/24.jpg)
Our Question
What is the maximum number of arcs in a digraph with n vertices anda given zero forcing number k?
Combinatorial Matrix Theory (ISU) October 2013 12 / 20
![Page 25: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/25.jpg)
Maximum Arc Digraph
|E | = 36, |Γ | = 7 and Z(Γ) = 3
k∑i<j
ninj +
(k∑
i=1
ni
)(k − 1) −
(k2
)+
k∑i=1
[(ni
2
)+ (ni − 1)
]
Combinatorial Matrix Theory (ISU) October 2013 13 / 20
![Page 26: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/26.jpg)
Maximum Arc Digraph
|E | = 36, |Γ | = 7 and Z(Γ) = 3
k∑i<j
ninj +
(k∑
i=1
ni
)(k − 1) −
(k2
)+
k∑i=1
[(ni
2
)+ (ni − 1)
]Combinatorial Matrix Theory (ISU) October 2013 13 / 20
![Page 27: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/27.jpg)
Formulation
Given ni vertices in the i-th forcing chain and Z(Γ) = k :∑ki<j ninj
Combinatorial Matrix Theory (ISU) October 2013 14 / 20
![Page 28: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/28.jpg)
Formulation
Given ni vertices in the i-th forcing chain and Z(Γ) = k :
+(∑k
i=1 ni
)(k − 1)
Combinatorial Matrix Theory (ISU) October 2013 14 / 20
![Page 29: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/29.jpg)
Formulation
Given ni vertices in the i-th forcing chain and Z(Γ) = k :
−(k
2
)
Combinatorial Matrix Theory (ISU) October 2013 14 / 20
![Page 30: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/30.jpg)
Formulation
Given ni vertices in the i-th forcing chain and Z(Γ) = k :
+∑k
i=1[(ni
2
)+ (ni − 1)
]
Combinatorial Matrix Theory (ISU) October 2013 14 / 20
![Page 31: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/31.jpg)
Formulation
Given ni vertices in the i-th forcing chain and Z(Γ) = k :∑ki<j ninj +
(∑ki=1 ni
)(k − 1) −
(k2
)+∑k
i=1[(ni
2
)+ (ni − 1)
]
Combinatorial Matrix Theory (ISU) October 2013 14 / 20
![Page 32: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/32.jpg)
TheoremFor a digraph Γ of order n with Z(Γ) = k ,
|E | 6(n
2
)−(k
2
)+k (n − 1)
Combinatorial Matrix Theory (ISU) October 2013 15 / 20
![Page 33: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/33.jpg)
Independence of Distribution of Vertices
Given |Γ | = n and Z(Γ) = k , the maximum number of arcs isindependent of the distribution of the vertices into each of the k forcingchains.
|Γ | = 7 and Z(Γ) = 3|E(Γ)| = 36
|Γ | = 7 and Z(Γ) = 3|E(Γ)| = 36
Combinatorial Matrix Theory (ISU) October 2013 16 / 20
![Page 34: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/34.jpg)
Maximum Nullity of a Maximum Arc Digraph
TheoremIf Γ is a digraph with the maximum number of arcs (by ourconstruction), then M(Γ) = Z(Γ).
Γ realizing the maximum number ofarcs
? ∗ ∗ 0 0∗ ? ∗ ∗ ∗∗ ∗ ? ∗ 0∗ ∗ ∗ ? ∗∗ ∗ ∗ ∗ ?
Family of matrices corresponding
to Γ
Here Z(Γ) = 2 and M(Γ) = 2.
Combinatorial Matrix Theory (ISU) October 2013 17 / 20
![Page 35: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/35.jpg)
References I
[1] AIM Minimum Rank - Special Graphs Work Group (F. Barioli, W.Barrett, S. Butler, S. M. Cioaba, D. Cvetkovic, S. M. Fallat, C.Godsil, W. Haemers, L. Hogben, R. Mikkelson, S. Narayan, O.Pryporova, I. Sciriha, W. So, D. Stevanovic, H. van der Holst, K.Vander Meulen, A. Wangsness). Zero forcing sets and theminimum rank of graphs. Linear Algebra and its Applications, 428:1628-1648, 2008.
[2] W. Barrett, H. van der Holst, and R. Lowey. Graphs whoseminimal rank is two. Electronic Journal of Linear Algebra,11:258-280, 2004.
[3] A. Berliner, M. Catral, L. Hogben, M. Huynh, K. Lied, M. Young.Minimum rank, maximum nullity, and zero forcing number forsimple digraphs. Under review.
Combinatorial Matrix Theory (ISU) October 2013 18 / 20
![Page 36: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/36.jpg)
References II
[4] J. Ekstrand, C. Erickson, H. T. Hall, D. Hay, L. Hogben, R.Johnson, N. Kingsley, S. Osborne, T. Peters, J. Roat, A. Ross, D.D. Row, N. Warnberg, M. Young. Positive semidefinite zeroforcing. Linear Algebra and its Applications, in press.
[5] L. Hogben. Minimum rank problems. Lin. Alg. Appl., 432:1961-1974, 2010.
[6] R. C. Read and R. J. Wilson. An Atlas of Graphs, OxfordUniversity Press, New York, 1998.
[7] J. Sinkovic. Maximum nullity of outerplanar graphs and the pathcover number. Linear Algebra and its Applications, 432:2052-2060, 2010.
Combinatorial Matrix Theory (ISU) October 2013 19 / 20
![Page 37: Maximum Arc Digraph with a Given Zero Forcing Number · Combinatorial Matrix Theory (ISU) October 2013 6 / 20 Thezero forcing number, Z(), is the minimum number of vertices that need](https://reader033.vdocuments.mx/reader033/viewer/2022052801/5f15842a7202c833ee7ff8ad/html5/thumbnails/37.jpg)
Acknowledgments
Thank you to:
The National Science Foundation (NSF DMS 0750986)
Iowa State University
Leslie Hogben, Adam Berliner, Travis Peters,
Michael Young, and Nathan Warnberg
Joshua Carlson, Jason Hu, Katrina Jacobs, Kathryn Manternack
Combinatorial Matrix Theory (ISU) October 2013 20 / 20