Minimum Degree Distance of Five Cyclic Graphs

Let G be a connected graph with n vertices. Then the class of connected graphs having n vertices is denoted by Gn. The subclass of connected graphs with 5 cycles are denoted by Gn5. The classification of graph G∈Gn5 depends on the number of edges and the sum of the degrees of the vertices of the graph. Any graph in Gn5 contains five linearly independent cycles having at least n+3 edges and the sum of degrees of vertices of 5-cyclic must be equal to twice of n+4. In this paper, minimum degree distance of class of five cyclic connected graph is investigated. To find minimum degree distance of a graph some transformations T have been defined. These transformation have been applied on the graph G∈Gn5 in such a way that the resultant graph belongs to Gn5 and also degree distance of T(G) is always must be less than G. For n=5, the five 5-cyclic graph has minimum degree distance 78 and the minimum degree distance of 5-cyclic graphs having six vertices is 124. In case of n greater than 6, a general formula for minimum degree distance is investigated. In this paper, we proved that the minimum degree distance of connected 5 cyclic graphs is 3n2+13n-62 by using transformations, for n≥7.