Distance Degree Index of Some Derived Graphs

Topological indices are numerical values associated with a graph (structure) that can predict many physical, chemical, and pharmacological properties of organic molecules and chemical compounds. The distance degree (DD) index was introduced by Dobrynin and Kochetova in 1994 for characterizing alkanes by an integer. In this paper, we have determined expressions for a DD index of some derived graphs in terms of the parameters of the parent graph. Specifically, we establish expressions for the DD index of a line graph, subdivision graph, vertex-semitotal graph, edge-semitotal graph, total graph, and paraline graph.


Introduction
Graph theory is becoming interestingly significant as it is being actively applied in biochemistry, nanotechnology, electrical engineering, computer science, and operations research [1][2][3][4].The powerful combinatorial method found in graph theory has also been used to prove the results of pure mathematics.A topological index, also known as a graph descriptor, is a real number associated with a graph.Topological indices are helpful for predicting certain physical, chemical, and pharmacological properties of organic molecules and chemical compounds.
A molecular graph is a graphical description of the structural formula of a chemical compound with the help of graph theory.In the construction of a chemical graph, atoms are represented by nodes or vertices and bonds between the atoms are represented by lines or edges [5].In all major fields of chemistry, chemical graphs are used for many different purposes [6].As has already been proved in [7], the said indices are useful for characterizing alkanes by an integer.Although the computed expression does not have direct application, we believe that it can be used to compute the said indices for chemical and molecular graphs, which are useful for characterizing alkanes by an integer.
All graphs considered in this paper are simple and connected.Let G = G(V, E) be a simple and connected graph with vertex set V = V(G) and edge set E = E(G).The degree of vertex i in G is denoted by δ G (i) and is defined as the number of edges incident with vertex i.Also, the degree of an edge e = ij in G is denoted by δ G (e) and is defined as the number of edges incident to both its end vertices, i and j.Mathematically, δ G (e) = δ G (i) + δ G (j) − 2. A complete graph on n vertices is denoted by K n and defined as a graph in which every vertex is adjacent to all other vertices.Let H and K be two subgraphs of G, such that V(H) ∩ V(K) = φ.Let i ∈ V(H) and j ∈ V(K) be the vertices such that then i and j are called the terminal vertices of subgraphs H and K in G, as shown in the following figure.
In Figure 1, H and K are subgraphs of graph G.In graph G, the distance between vertex c of H and the vertex f of K is 1, which is the minimum of all vertices of H and K. So, c and f are known as terminal vertices of H and K in G.
both its end vertices,and .Mathematically,

∈ ∈
; then i and j are called the terminal vertices of subgraphs H and K in G ,as shown in the following figure.
In Figure 1,  and  are subgraphs of graph .In graph , the distance between vertex  of  and the vertex  of  is 1, which is the minimum of all vertices of  and .So,  and  are known as terminal vertices of  and  in .The first and second Zagreb indices were defined by Gutman and Trinajasti c′ in 1972 [8] and very useful in QSPR and QSAR [9][10][11].The first and second Zagreb index are defined as: Another vertex-degree based topological index was found to be useful in the earliest work on Zagreb indices [8], but later it was totally ignored.Quite recently, some interest was shown in it [12,13].It is called the Forgotten index or simply F-index and defined as: In 2008, Došli c′ introduced the first Zagreb coindex [14], which is defined as: In 1947, the chemist Harold Wiener introduced the Wiener index [15], which correlates to the boiling point and structure of the molecule of paraffins.The Wiener index is the oldest topological index and is defined as: The first and second Zagreb indices were defined by Gutman and Trinajastić in 1972 [8] and very useful in QSPR and QSAR [9][10][11].The first and second Zagreb index are defined as: and Another vertex-degree based topological index was found to be useful in the earliest work on Zagreb indices [8], but later it was totally ignored.Quite recently, some interest was shown in it [12,13].It is called the Forgotten index or simply F-index and defined as: In 2008, Došlić introduced the first Zagreb coindex [14], which is defined as: In 1947, the chemist Harold Wiener introduced the Wiener index [15], which correlates to the boiling point and structure of the molecule of paraffins.The Wiener index is the oldest topological index and is defined as: where d G (i, j) is the distance in G between the vertices i and j.The Wiener index attracts many chemists and mathematicians and has a long history in the literature.For details, see [16][17][18][19][20][21].For the applications of the molecular structures, see [22].
The edge version of the Wiener index was introduced in 2010 [23], and is defined as: where d G (e, f ) is the distance between the edges e = xy and f = ij in G and defined as: The degree distance index (DD index) was introduced in [7] by Dobrynin and Kochetova and is defined as: For a brief look at the different results of DD index, see [24][25][26][27][28][29].We define an edge version of DD index as, The distance between the edge e = xy and a vertex i is defined as For basic terminology, see [30].
Edge-Semitotal Graph: The edge-semitotal graph of a graph G is denoted as T 2 = T 2 (G) and is obtained by inserting a new vertex ateach edge of G, joining those new vertices by edges whose corresponding edges are incident in G.We have Total Graph: The union of edge-semitotal graph and vertex-semitotal graph is called total graph of a graph G.It is denoted by T = T(G).Also, Paraline Graph: The paraline graph PL = PL(G) is the line graph of subdivision graph denoted by In [20], one sees that M 1 (S) = M 1 + 4m.Thus, In Figure 2, self-explanatory examples of these derived graphs are given for a particular graph.In every derived graph of G (except the paraline graph PL(G)), the vertices corresponding to the vertices of G are denoted by circles and the vertices corresponding to the edges of G are denoted by squares.

2
Paraline Graph: The paraline graph is the line graph of subdivision graph denoted by In [20], one sees that In Figure 2  The following is a known result of Zagreb indices.
Lemma 1 [31] For a graph G with n vertices and m edges, we have

DD Index of Some Derived Graphs
In [31][32][33] the authors studied the expressions for Zagreb indices and multiplicative Zagreb indices of aforementioned derived graphs.In the past authors dealt only with degree-based indices to derive expressions for the derived graphs.The following proposition encourages us to deal with degree distance-based index.In this section, we study degree distance-based index, DD index for these derived graphs.The following is a known result of Zagreb indices.Lemma 1. [31] For a graph G with n vertices and m edges, we have

DD Index of Some Derived Graphs
In [31][32][33] the authors studied the expressions for Zagreb indices and multiplicative Zagreb indices of aforementioned derived graphs.In the past authors dealt only with degree-based indices to derive expressions for the derived graphs.The following proposition encourages us to deal with degree distance-based index.In this section, we study degree distance-based index, DD index for these derived graphs.
For a subdivision graph S, a vertex-semitotal graph T 1 , an edge-semitotal graph T 2 , and a total graph T, we can categorize the vertex set into two types of vertices.The first is the set of vertices of G and the second is the set of vertices corresponding to the edges of G.We name them α-type and β-type vertices, respectively.On the basis of this division, there are three types of edges in these graphs: 1.
αβ-edge, an edge between an α-type vertex and a β-type vertex.
Theorem 1.If S = S(G) is a subdivision graph of graph G, then Proof.We can see that for any α-type vertex i α of S and for any β type vertex By definition of the DD index, we have Theorem 2. If T 1 is the vertex-semitotal graph of graph G, then Proof.First note that for any α-type vertex i α of T 1 and for any β-type vertex j β of T 1 Also, We have Therefore, Proof.To prove this theorem, we proceed in a similar way.First note that for any α-type and for any β-type vertex j β of T 2 Also, So, Using the Lemma 1 and relation Theorem 4. If T is the total graph of graph G, then and for any β-type vertex Lemma 2. For graph G the following equality holds.
Proof.First we calculate Now the above calculated expression can be written as follows: which gives us the equation which completes the proof.
Theorem 5. Let G be a graph having no cycle of even length.If PL = PL(G) is a paraline graph of G, then Proof.It can be noted that for any vertex i ∈ V(G) there are δ G (i) vertices in PL having the same degree as the vertex i such that all the δ G (i) vertices are connected with each other.In fact, PL(G) can be obtained from G by replacing every vertex i by K δ G (i) .By definition of the DD index, [δ PL (u) + δ PL (v)]d PL (u, v).
Here we discuss the two terms one by one.

I.
In the first term, for any vertex i ∈ V(G) there are a total of δ G (i)(δ G (i)−1) 2 pairs of vertices in PL(G) of degrees δ G (i) and having a distance of 1 between them in the corresponding K δ G (i) .

II.
Before discussing the second term, it is important to see that there is exactly one shortest path in G between any two different vertices, because G has no cycle of even length.Consequently, there is exactly one shortest path between their corresponding complete graphs in PL(G).Now, in the second term, for any pair of vertices i and j in G, we have the following cases in corresponding pair of complete graphs K δ G (i) and K δ G (j) in PL(G): Case-1: There is exactly one pair of terminal vertices in K δ G (i) and K δ G (j) , having distance [2d G (i, j) − 1] between them.Case-2: There are [δ G (i) − 1][δ G (j) − 1] pairs of non-terminal vertices in K δ G (i) and K δ G (j) , having distance [2d G (i, j) + 1] between them.Case-3: There are (δ G (i) − 1) pairs of vertices having a non-terminal vertex in K δ G (i) and a terminal vertex in K δ G (j) , and having distance 2d G (i, j) between them.Similarly, there are (δ G (j) − 1) pairs of vertices having a terminal vertex in K δ G (i) and a non-terminal vertex in K δ G (j) , and having distance 2d G (i, j) between them.So we have a total of [δ G (i) + δ G (j) − 2] such pairs.

Figure 1 .
Figure 1.Graph  with its subgraphs  and .

Figure 1 .
Figure 1.Graph G with its subgraphs H and K.
and there is an edge between two vertices of L if and only if corresponding edges are incident in G. Clearly, |V(L)| = m and by hand shaking-lemma one can easily see that |E(L)| = M 1 2 − m.Subdivision Graph: Subdivision graph of a graph G is obtained by inserting a vertex of degree 2 in each edge.Therefore, |V(S)| = |V(G)| + |E(G)| = n + m and |E(S)| = 2|E(G)| = 2m.Vertex-Semitotal Graph: Vertex-Semitotal graph of a graph G is denoted as T 1 = T 1 (G) and is obtained by adding a new vertex to each edge of G and then joining a new vertex to the end vertices of the corresponding edge.Thus, |V(T 1 )| = |V(G)| + |E(G)| = n + m and , self-explanatory examples of these derived graphs are given for a particular graph.In every derived graph of G (except the paraline graph ) (G PL ), the vertices corresponding to the vertices of G are denoted by circles and the vertices corresponding to the edges of G are denoted by squares.

Figure 2 .
Figure 2.Different graphs derived from G .

Figure 2 .
Figure 2. Different graphs derived from G.

Theorem 3 .
If T 2 is an edge-semitotal graph of graph G, then DD(T 2 ) = DD(G) + DD e (G) + 4W e (G) + nM 1 (G) DD(PL) = ∑ {u,v}⊆V(PL) [δ PL (u) + δ PL (v)]d PL (u, v).Now, either u or v belongs to the same K δ G (i) or two different K δ G (i) values, where i ∈ V(G).So, DD(PL) = ∑ u,v∈K d G (i) ,i∈V(G) [δ PL (u) + δ PL (v)]d PL (u, v) + ∑ u∈K d G (i) ,v∈K d G (j) ,{i,j}⊆V(G) graph on n n K and defined as a graph in which every vertex is adjacent to all other vertices.Let H and K be two subgraphs of G , such that