Eileen M. Pagaduan
N x n matrix A= (Aij) in which the entry aij= 1 if
there is an edge form vertex i to j and is 0 if
there is no edge from vertex i to j.
Matrix with rows and columns labeled by graph
vertices with 1 or 0 in position.
Simple graph with no loops: 0s on the diagonal
Undirected graph: symmetric
Representing which vertices (or nodes) of a
graph are adjacent to which other vertices.