Write adjacency and incidence matrix for all the graphs developed?
Answers
Answered by
2
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of thematrix indicate whether pairs of vertices are adjacent or not in thegraph. In the special case of a finite simple graph, the adjacency matrixis a (0,1)-matrix with zeros on its diagonal.
Answered by
2
In graph theory an undirected graph has two ... The unoriented incidence matrix (or simply ... vertex of e, and all other rows have 0.
Similar questions