## Abstract

In this paper, we define new graph operations *F*-composition *F* (*G*)[*H*], where *F* (*G*) be one of the symbols *S*(*G*)*,M*(*G*)*,Q*(*G*)*,T*(*G*),Λ(*G*),Λ[*G*]*,D*_{2}(*G*)*,D*_{2}[*G*]. Further, we give some results for the Wiener indices of the these graph operations.

## 1 Introduction

A *graph G* =(*V,E*) is an ordered pair of set of vertices and edges, where edges are unordered pair of vertices. Also *G* is said to be a (*p,q*) graph if *|V|* = *p* and *|E|* = *q*. For a graph *G* = (*V,E*) if *u*, *v ∈V*(*G*) then the *distance d* (*u, v*) between *u* and *v* is defined as the length of a shortest *u*-*v* path in *G*. The *Wiener index* of *G*, denoted by *W*(*G*), is defined as

where the sum is taken through all unordered pairs of vertices of *G*. Wiener index was introduced by Wiener [17]. It is related to boiling point, heat of evaporation, heat of formation, chromatographic retention times, surface tension, vapour pressure, partition coefficients, total electron energy of polymers, ultrasonic sound velocity, internal energy, etc., (see [12]). For this reason Wiener index is widely studied by chemists. Mathematical properties and chemical applications of the Wiener index have been intensively studied over the past thirty years. For more information about the Wiener index in chemistry and mathematics (see [11]) and [1, 3, 4, 5, 6, 7, 8, 9, 10, 13, 18], respectively. In this paper we introduce a new composition of two graphs and study the Wiener indices of the resulting graphs.

The composition of two graphs *G* = (*p,q*) and *H* = (*r, s*) is denoted by *G*[*H*], whose vertex set is *V*(*G*) *× V*(*H*) and two vertices *u* = (*u*_{1}*,u*_{2}) and *v* = (*v*_{1}*, v*_{2}) *∈ V*(*G*[*H*]) are adjacent if and only if [*u*_{1} = *v*_{1} and (*u*_{2}*, v*_{2}) *∈ E*(*H*)] or [(*u*_{1}*, v*_{1}) *∈ E*(*G*)]. Note that *G*[*H*] has *p* copies of *H*, and we may label these copies by vertices of *V*(*G*). Now two vertices with the same name in different copies are adjacent in *G*[*H*] if and only if their corresponding labels are adjacent in *G*. The graphs *G*, *H* and their composition *G*[*H*] are shown in Figure 1.

We are interested in giving new composition of graphs such that (*V*(*G*) *∪ E*(*G*)) *× V*(*H*) and (*V*(*G*) *∪ V′*(*G*)) *× V*(*H*) are the set of vertices. For this purpose we first recall some operations on graphs.

The *total graph T*(*G*) is the graph whose vertex set is *V*(*G*) *∪ E*(*G*) and two vertices are adjacent if and only if they are adjacent or incident in *G*. The notion of total graph was introduced by Behzad & Chartrand [2]. The *middle graph* or *semi-total line graph M* (*G*) of *G* is the graph whose vertex set is *V*(*G*) *∪ E*(*G*). Two vertices in *M* (*G*) are adjacent if and only if they are adjacent edges in *G*, or one is a vertex and another is an edge incident on it in *G*. A structural characterization and various properties of middle graphs were presented by Sampathkumar & Chikkodimath [14]. The *semi-total point graph Q*(*G*) of *G* is the graph whose vertex set is *V*(*G*)*∪E*(*G*). Two vertices in *Q*(*G*) are adjacent if and only if they are adjacent vertices in *G*, or one is a vertex and another is an edge incident on it in *G*. It is introduced by Sampathkumar & Chikkodimath [15]. The *subdivision graph S* (*G*) of *G* is the graph whose vertex set is *V*(*G*)*∪E*(*G*). Two vertices in *S* (*G*) are adjacent if and only if one is a vertex and another is an edge incident on it in *G*. The subdivision graph *S* (*G*), the semi-total point graph *Q*(*G*), the middle graph *M* (*G*) and the total graph *T*(*G*) of a graph *G* are shown in Figure 2.

The graphs *G*, *S*(*G*), *Q*(*G*), *M*(*G*), *T*(*G*)

Citation: Applied Mathematics and Nonlinear Sciences 4, 1; 10.2478/AMNS.2019.1.00016

The *splitting graph* Λ(*G*) of a graph *G* is the graph whose vertex set is *V*(*G*)*∪V*(*G*), where *V′*(*G*) is the copy of *V*(*G*) (i.e., *V′*(*G*) = *{v′*: *v ∈ V*(*G*)*}*) and the edge set is *E*(*G*)*∪{xy′*: *xy ∈ E*(*G*)*}*. The vertex *v′* is called the twin of the vertex *v*, (and *v* the twin of *v′*). It is introduced by Sampathkumar and Walikar [16] . The*closed splitting graph* Λ[*G*] of a graph *G* is the graph whose vertex set is *V*(*G*)*∪V′*(*G*), where *V′*(*G*) is the copy of *V*(*G*) (i.e., *V′*(*G*) = *v′*: *v ∈ V*(*G*)) and the edge set is *E*(*G*) *∪ {xx′*: *x ∈ V*(*G*)*} ∪ {xy′*: *xy ∈ E*(*G*)*}*. The *shadowgraph* of *G*, denoted by *D*_{2}(*G*), has as the vertex set *V*(*G*) *∪ V′*(*G*), and the edge set *E* (*G*) *∪ {x′y*: *xy ∈ E* (*G*)*} ∪ {xy′*: *xy ∈ E* (*G*)*}*. The *closed shadowgraph* of *G*, denoted by *D*_{2}[*G*], has as the vertex set *V*(*G*)*∪V*(*G*), and the edge set *E*(*G*)*∪{x′y′*: *xy ∈ E*(*G*)*}∪{xy′*: *xy ∈ E*(*G*)*}∪{xx′*: *x ∈ V*(*G*)*}*. The vertex *v*is called the twin of the vertex *v*, (and *v* the twin of *v′*). We illustrate these definitions in Figure 3.

The graphs *G*, *P* = Λ(*G*), *Q* = Λ[*G*], *R* = *D*_{2}(*G*) and *S* = *D*_{2}[*G*]

Citation: Applied Mathematics and Nonlinear Sciences 4, 1; 10.2478/AMNS.2019.1.00016

Let *G* =(*p,q*) and *H* =(*r, s*) be two graphs and also let *F*(*G*) be one of the symbols *S*(*G*)*,M*(*G*)*,Q*(*G*)*,T*(*G*). The *F*-composition *F* (*G*)[*H*] is a graph with the set of vertices *V*(*F*(*G*)[*H*]) = (*V*(*G*)*∪E*(*G*))*×V*(*H*) and two vertices *u*=(*u*_{1}*,u*_{2}) and *v* =(*v*_{1}*, v*_{2}) of *F*(*G*)[*H*] are adjacent if and only if [*u*_{1} =*v*_{1} *∈V*(*G*) and (*u*_{2}*, v*_{2}) *∈ E*(*H*)] or [(*u*_{1}*, v*_{1}) *∈ E*(*F*(*G*))]. Note that *F* (*G*)[*H*] has *p* copies of the graph *H*, and we may label these copies by vertices of *G*. We illustrate these definitions in Figure 4.

The graphs *G*, *H*, *S*(*G*)[*H*], *Q*(*G*)[*H*], *M*(*G*)[*H*] and *T*(*G*)[*H*]

Citation: Applied Mathematics and Nonlinear Sciences 4, 1; 10.2478/AMNS.2019.1.00016

Let *G* = (*p,q*) and *H* = (*r, s*) be two graphs and also let *F* (*G*) be one of the symbols Λ(*G*),Λ[*G*]*,D*_{2}(*G*)*,D*_{2}[*G*]. The *F*-composition *F* (*G*)[*H*] is a graph with the set of vertices *V*(*F*(*G*)[*H*]) = (*V*(*G*)*∪V′*(*G*))*×V*(*H*) and two vertices *u* = (*u*_{1}*,u*_{2}) and *v* = (*v*_{1}*, v*_{2}) of *F*(*G*)[*H*] are adjacent if and only if [*u*_{1} = *v*_{1} *∈ V*(*G*) and (*u*_{2}*, v*_{2}) *∈ E*(*H*)] or [(*u*_{1}*, v*_{1}) *∈ E*(*F*(*G*))]. Note that *F*(*G*)[*H*] has *p* copies of the graph *H*, and we may label these copies by vertices of *G*. We illustrate these definitions in Figure 5.

The graphs *G*, *H*, *P* = Λ(*G*)[*H*], *Q* = Λ[*G*][*H*], *R* = *D*_{2}(*G*)[*H*] and *S* = *D*_{2}[*G*][*H*]

Citation: Applied Mathematics and Nonlinear Sciences 4, 1; 10.2478/AMNS.2019.1.00016

## 2 Main Results

*[18] Let G* = (*p,q*) *and H* = (*r, s*) *be two connected graphs. Then*,

*Let G* = (*p,q*) *and H* = (*r, s*) *be two connected graphs and F*(*G*) = *S*(*G*)*,Q*(*G*)*,M*(*G*)*, or T*(*G*)*. Then*,

*Proof*. Let *G* =(*p,q*) and *H* =(*r, s*) be two connected graphs. By the definition of *F* (*G*)[*H*] it can be understood as obtained by taking *p* copies of *H* and by joining all the vertices of *i ^{th}* and

*j*copies of

^{th}*H*if and only if the

*i*and

^{th}*j*vertices of

^{th}*G*are adjacent. Also a pair of vertices of

*F*(

*G*)[

*H*] whose first tuple is corresponding

to the edges of *G* are adjacent to the vertices of *F* (*G*)[*H*] if their first tuple are adjacent in *F* (*G*). Hence, the vertices in each copy of *H* of *F* (*G*)[*H*] are either adjacent (if they are adjacent in *H*) or are at distance 2 (if they are non-adjacent in *H*). A pair of verices of *F* (*G*)[*H*] belonging to different copies of *H* has the same distance as the corresponding two vertices of *G*. Also a pair of vertices of *F* (*G*)[*H*] corresponding to the edges of *G*, whose second tuple is not same and first tuple is same, has the distance always two. And a pair of verices of *F* (*G*)[*H*], whose first tuple is corresponding to the vertices of *F* (*G*) has the same distance as the corresponding two vertices of *F* (*G*). From this we get,

*Let G* = (*p,q*) *and H* = (*r, s*) *be two connected graphs and F*(*G*) = Λ(*G*),Λ[*G*]*,D*_{2}(*G*)*, or D*_{2}[*G*]*. Then*,

*Proof*. Let *G* =(*p,q*) and *H* =(*r, s*) be two connected graphs. By the definition of *F* (*G*)[*H*] it can be understood as obtained by taking *p* copies of *H* and by joining all the vertices of *i ^{th}* and

*j*copies of

^{th}*H*is and only if the

*i*and

^{th}*j*vertices of

^{th}*G*are adjacent. Also a pair of vertices of

*F*(

*G*)[

*H*] whose first tuple is twin of the vertices of

*G*are adjacent to the vertices of

*F*(

*G*)[

*H*] if their first tuple are adjacent in

*F*(

*G*). Hence, the vertices in each copy of

*H*of

*F*(

*G*)[

*H*] are either adjacent (if they are adjacent in

*H*) or are at distance 2 (if they are non-adjacent in

*H*). A pair of verices of

*F*(

*G*)[

*H*] belonging to different copies of

*H*has the same distance as the corresponding two vertices of

*G*. Also a pair of vertices of

*F*(

*G*)[

*H*] corresponding to twin of the vertices of

*G*, whose second tuple is not same and first tuple is same, has the distance always two. And a pair of verices of

*F*(

*G*)[

*H*], whose first tuple is corresponding to the vertices of

*F*(

*G*) has the same distance as the corresponding two vertices of

*F*(

*G*). From this we get,

## 3 Conclusion

Here, we have defined new graph operations *F*-composition *F* (*G*)[*H*], where *F* (*G*) be one of the symbols *S*(*G*)*,M*(*G*)*,Q*(*G*)*,T*(*G*),Λ(*G*),Λ[*G*]*,D*_{2}(*G*)*,D*_{2}[*G*]. Then, we gave some results for the Wiener indices of the these graph operations.

Communicated by Juan Luis García Guirao

## References

- [1]↑
I. Althöfer, Average distance in undirected graphs and the removal of vertices J. Combin. Theory Ser. B, 48(1990), 140-142.

- [2]↑
M. Behzad and G. Chartrand, Total graphs and traversability Proc. Edinb. Math. Soc., 15(2)(1966), 117-120.

- [4]↑
D.M. Cvetkocic, M. Doob and H. Sachs, Spectra of graphs Theory and Application Academic Press, New York, 1980.

- [6]↑
A.A. Dobrynin, R. Entringer and I. Gutman, Wiener index of trees: Theory and applications Acta Appl. Math., 66(2001), 211-249.

- [7]↑
M. Eliasi and B. Taeri, Four new sums of graphs and their Wiener indices Discrete Appl. Math., 157(2009), 794-803.

- [8]↑
R.C. Entringer, D.E. Jackson and D.A. Snyder, Distance in graphs Czechoslovak Math. J., 26(1976), 283-296.

- [9]↑
I. Gutman, J.C. Chen and Yeong-Nan Yeh, On the sum of all distances in graphs Tamkang J. Math., 25(1993), 83-86.

- [10]↑
I. Gutman, S.L. Lee, Y.L. Luo and Yeong-Nan Yeh, Recent results in the theory of the Wiener number Indian J. Chem., 32A(1993), 651-661.

- [11]↑
I. Gutman and O.E. Polansky, Mathematical Concepts in Organic Chemistry Springer, Berlin, 1986.

- [12]↑
I. Gutman and I.G. Zenkevich, Wiener index and vibrational energy Z. Naturforsch., 57(2002), 824-828.

- [14]↑
E. Sampathkumar and S.B. Chikkodimath, Semitotal graphs of a graph-I, Journal of Karnatak University Science, 18(1973), 274-280.

- [15]↑
E. Sampathkumar and S.B. Chikkodimath, Semitotal graphs of a graph-II, Journal of Karnatak University Science, 18(1973), 281-284.

- [16]↑
E. Sampathkumar and H.B. Walikar, On Splitting Graph of a Graph J. Karnatak Univ. Sci., 25(13)(1980), 13-16.

- [17]↑
H. Wiener, Structural determination of paraffin boiling points J. Amer. Chem. Soc., 69(1947), 17-20.

- [18]↑
Y.N. Yeh and I. Gutman, On the sum of all distances in composite graphs Discrete Math., 135 (1994), 359-365.