Isomorphic Properties among the Connectivity of Various Graphs

The various types of identical graphs having molecular structure of different degrees are isomorphic. In this paper, we study the structure of two graphs, which are isomorphic. Among the class of trees (star like tree) unicyclic, bicyclic, tricyclic, tetracyclic, pentacyclic, hexa-cyclic, heptacyclic etc. are isomorphic. Under discussion two graphs G_1 and G_2 are isomorphic because both graphs have same number of vertices and edges. We also point out different important applications of the various types of isomorphic graphs. In whole, we study about two graphs that can exist in different forms having the same number of vertices, edges having same degrees and the same edge connectivity. Such graphs called isomorphic graphs. While graph plotting and graph representation are sufficient topic in graph theory. In order to concentrate only on the abstract structure of graphs. A graph property defined to be a property to keep safe under all isomorphic of a graph. By brief look, we see that two graphs may appear very different when inspected visually, but they could have the same adjacency structure.