![]() If there exists an edge between vertex V i and V j, where i is a row, and j is a column, then the value of a ij = 1.Let's see some of the important points with respect to the adjacency matrix. If an Undirected Graph G consists of n vertices then the adjacency matrix of a graph is n x n matrix A = and defined by -Ī ij = 1 Sometimes it is also called a Vertex matrix. ![]() ![]() If a graph has n number of vertices, then the adjacency matrix of that graph is n x n, and each entry of the matrix represents the number of edges from one vertex to another.Īn adjacency matrix is also called as connection matrix. It is the 2D matrix that is used to map the association between the graph nodes. In graph theory, an adjacency matrix is a dense way of describing the finite graph structure. In this article, we are going to discuss the adjacency matrix along with its representation. Next → ← prev What is an adjacency matrix?
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |