Adjacency matrices and Incidence matrices 4 Definition 12: Let G(V,E) be a graph of non-multiple edge where vn. Suppose that v1,v2,,n are the vertices. The adjacency matrix A of G, with respect to this listing of the vertices, is the nxn zero-one matrix with 1 as its (i,jth entry when vi and vi are adjacent, and 0 as its (i,jth entry when they are not adjacent. In other words, If its adjacency matrix is A=lail, then 扩f, v is an edge of g otherwiseAdjacency matrices and Incidence matrices ❖ Definition 12: Let G(V,E) be a graph of non-multiple edge where |V|=n. Suppose that v1 ,v2 ,…,vn are the vertices. The adjacency matrix A of G, with respect to this listing of the vertices, is the nn zero-one matrix with 1 as its (i,j)th entry when vi and vj are adjacent, and 0 as its (i,j)th entry when they are not adjacent. In other words, If its adjacency matrix is A=[aij], then    = otherwise i f v v i s an edge of G a i j i j 0 1 { , }