Graphics Representation Using Adjacency Matrix, Incidence Matrix, Adjacency List and Isomorphic Graph

Abstract

A graph is a non-empty set of elements called points and those points are connected by sides (edge). The set of points of the dinotic graph with “V” and the set of side dinotics with “E”. What will be discussed in this article is the representation of the graph using the matrix of compass, compass and compass list. In this study used is the study of libraries that is by collecting information from books or journals related to the representation of graphs. In a graph matrix, it can be concluded that the representation of the graph by using the matrix of inconsistency on on on each column and line is worth 1 if the node i is adjacent to j and is worth 0 if Simpul i is not inconsistent with j. The difference is by counting the values that exist on each row and column with a value of 1 if the node i is in line with node j and is in value of 0 if the Simpul i is not adjacent to the simpul j.