Machine generated contents note: 1.1.Nonnegative Matrices --
1.2.Symmetric Matrices --
Bibliography --
2.1.Some Basic Properties --
2.2.Eigenvalues and Graph Parameters --
2.3.Graphs with small Amax --
2.4.Laplacian Matrix of a Graph --
Bibliography --
3.1.Rado-Hall Theorem --
3.2.Applications --
Bibliography --
4.1.Motivation and Definition --
4.2.Colin de Verdiere Number and Graph Properties --
Bibliography --
5.1.Equivalent Formulations --
5.2.The Classes A(R, S) --
5.3.A Generalization --
Bibliography --
6.1.Sign-Nonsingular Matrices --
6.2.An Application --
6.3.Spectrally Arbitrary Sign Patterns --
Bibliography --
7.1.Some Classical Theorems --
7.2.Diagonal Products and Nonsingularity --
Bibliography --
8.1.Landau's Theorem --
8.2.A Special Tournament in T(R) --
8.3.Eigenvalues of Tournament Matrices --
Bibliography --
9.1.The Doubly Stochastic Polytope --
9.2.Alternating Sign Matrices --
9.3.The Alternating Sign Matrix Polytope --
9.4.ASM Patterns --
Bibliography Note continued: 10.1.(0, 1)-matrices with all Eigenvalues Positive --
10.2.Totally Nonnegative Matrices --
10.3.Totally Nonnegative (0, 1)-matrices --
Bibliography

Graphs and matrices enjoy a fascinating and mutually beneficial relationship. This interplay has benefited both graph theory and linear algebra. This is not a comprehensive study of graphs and matrices, instead the contributions have been chosen for their accessibility, beauty, and current relevance, and for the possibility of enticing the audience to want to learn more