Skip to main content
Heliyon logoLink to Heliyon
. 2020 Dec 22;6(12):e05781. doi: 10.1016/j.heliyon.2020.e05781

Computing F-index, coindex and Zagreb polynomials of the kth generalized transformation graphs

Durbar Maji 1, Ganesh Ghorai 1,
PMCID: PMC7770547  PMID: 33385087

Abstract

In chemical graph theory, forgotten topological index or F-index plays a crucial role to collect information about the properties of chemical compounds. The kth generalized transformation graphs of a molecular graph preserve the entire information on the molecular topology contained in the relevant molecular graph. In this paper, some exact expressions of the F-index and its co-index for the kth generalized transformation graphs are obtained. Also, the Zagreb polynomials, Zagreb co-polynomials and their complements are computed.

Keywords: Mathematics, Molecular graph, Zagreb indices, Transformation graphs, kth generalized transformation graph, Zagreb polynomial and co-polynomial, F-index and its coindex


Mathematics; Molecular graph; Zagreb indices; Transformation graphs; kth generalized transformation graph; Zagreb polynomial and co-polynomial; F-index and its coindex

1. Introduction

In theoretical chemistry, chemical compounds are often used to model different molecular structures which are graphically represented as molecular graphs in which atoms as nodes and chemical bonds as edges. Throughout this paper, we consider only molecular graphs that are simple. Let X=(n,m) be such a graph of order n and size m with vertex set V(X) and edge set E(X) such that |V(X)|=n and |E(X)|=m. Also, for any vertex pV(X), d(p/X) denotes the degree of that vertex in X. The graph X be the complement of X with the same vertex set V(X) and for any edge, pqE(X) exists if and only if pqE(X). So, it is clear that E(X)E(X)=E(Kn) and |E(X)|=(|V(X)|2)|E(X)|. Therefore, the degree of pV(X) is given by d(p/X)=|V(X)|1d(p/X).

We will follow reference [1] for undefined notation and terminology. Graph theory [2] provides a link between mathematics and chemistry by an important tool named topological index. Forty eight years ago the two oldest graph invariants namely first and second Zagreb indices are introduced by Gutman and Trinajestic [3]. The first Zagreb index is denoted as M1(X) and is defined by M1(X)=pV(X)d2(p/X)=pqE(X)[d(p/X)+d(q/X)]. Doslic [4] defined the first Zagreb coindex as M1(X)=pqE(X)[d(p/X)+d(q/X)]. Analogously to another topological index in [3] is calculated as the sum of the power three of degrees of the vertices of a graph. It is further found in Furtula et al. in [5]. This index is named as forgotten topological index or shortly, F-index which also influences the total π-electron energy (ϵ). This index is symbolically expressed as F(X)=pV(X)d3(p/X)=pqE(X)[d2(p/X)+d2(q/X)]. In 2016, De [6] introduced a new graph invariant, the F-coindex as follows F(X)=pqE(X)(d2(p/X)+d2(q/X)). Transformation graphs preserve the entire information from the original graph into new transformed structure. For details see [7]. The basic properties of transformation graphs can be followed in [8]. For more on transformation graphs refer to [9], [10]. We refer our readers to [11] for recent study.

Analogous to the Zagreb indices, Fath-Tabar [12] defined the first, second and third Zagreb polynomials as

M1(X,x)=pqE(X)xd(p/X)+d(q/X)
M2(X,x)=pqE(X)xd(p/X)d(q/X)

and

M3(X,x)=pqE(X)x|d(p/X)d(q/X)|

respectively.

On the base of Zagreb coindices, Basavanagoud and Jakkannavar [13] defined three new graph polynomials, namely the first, second and third Zagreb co-polynomials. They are as follows

M1(X,x)=pqE(X)xd(p/X)+d(q/X)
M2(X,x)=pqE(X)xd(p/X)d(q/X)

and

M3(X,x)=pqE(X)x|d(p/X)d(q/X)|

respectively.

Additionally, Shuxian [14] presented two new polynomials related to the first Zagreb index like as

M1(X,x)=pV(X)d(p/X)xd(p/X)

and

M0(X,x)=pV(X)xd(p/X).

Further, Bindusree et al. [15] introduced the following polynomials

Ma,b(X,x)=pqE(X)xad(p/X)+bd(q/X)

and

Ma,b(X,x)=pqE(X)x(d(p/X)+a)(d(q/X)+b).

Similarly, Basavanagoud et al. [13] also defined

Ma,b(X,x)=pqE(X)xad(p/X)+bd(q/X)

and

Ma,b(X,x)=pqE(X)x(d(p/X)+a)(d(q/X)+b),

where x is to be chosen as a variable.

For different recent study of F-index and its co-index, we refer to [8], [16], [17]. In order to know more about Zagreb polynomials and its co-polynomials for various transformation graphs see [15], [18], [19]. The following Propositions are instrumental in proving for the present considerations.

Proposition 1

[20] Let X be a graph with n vertices and m edges and X be the complement of X. Then

  • (i)

    M1(X)=n(n1)24m(n1)+M1(X).

  • (ii)

    M1(X)=M1(X)=2m(n1)M1(X).

  • (iii)

    M2(X)=2m212M1(X)M2(X)=m(n1)2+M2(X)(n1)M1(X).

  • (iv)

    M2(X)=m(n1)2(n1)M1(X)+M2(X).

Proposition 2

[21] Let X be an (n,m) graph. Then

  • (i)

    M1(Xk++)=(k+1)2M1(X)+4mk.

  • (ii)

    M1(Xk+)=m2k(nk+44k)+(k1)2M1(X)+(n2)2km.

  • (iii)

    M1(Xk+)=4m(n1)(k1)+(k1)2M1(X)+n(n1)2+4mk.

  • (iv)

    M1(Xk)=n(n+km1)24m(k+1)(n+km1)+(k+1)2M1(X)+km(n2)2.

Proposition 3

[6] Let X be a graph of order n and size m. Then

  • (i)

    F(X)=n(n1)36m(n1)2+3(n1)M1(X)F(X).

  • (ii)

    F(X)=(n1)M1(X)F(X)=2m(n1)2+F(X)2(n1)M1(X).

  • (iii)

    F(X)=2m(n1)2(n1)M1(X)F(X).

2. The kth generalized transformation graphs Xkuv

The kth generalized transformations which was introduced by Jummannaver et al. [21] is the new graphical transformations of generalized transformations [18], [22] of a graph. This concept was developed by using semitotal-point graph which was defined by Sampathkumar and Chikkodimath in [23] and later put forward as the kth semitotal-point graph which was introduced by Jog in [24] of a graph.

Definition 1

[21] Consider X(V(X),E(X)) be a simple, connected graph and u,v are the two graph parameters having values + or -. The k-th generalized transformation graph (GTG) Xkuv, is a new graph having V(Xkuv)=V(X)(E=j=ikEj) as vertex set and p,qV(Xkuv) such that the vertices p and q are adjacent in Xkuv if and only if the following conditions (i) and (ii) hold:

  • 1.

    p and q are adjacent in X if u=+ and non adjacent in X if u=.

  • 2.

    pV(X) and qEj, for some jβ (where β=1,2,...,mor1(0)m). Suppose ej be the edge of X and E1, E2, ..., Em be the distinct edge set and each Ej is corresponding to the edge ej in X such that |Ej|=k,j=1(0)m. The vertex p and ej are incident in X if v=+ and are not incident in X if v=.

There exist 4-distinguished 2-permutations of {+,}. The four graphical transformations in X like as Xk++,Xk+,Xk+ and Xk can be established. Also their complements like Xk++,Xk+,Xk+ and Xk can be obtained. The vertex p of Xkuv corresponding to a vertex p of X is referred to as a point vertex. Also, the vertex e of Xkuv corresponding to an edge e of X is referred to as a line vertex. To know more about the transformation graphs we can study in [25], [26].

There are two different types of edge partitions in the kth GTG (Xkuv) and its complement Xkuv. Firstly in each Xkuv, the edges can be split into two parts like E1uv/k and E2uv/k. Other hand, in each Xkuv, the partition of the edge set E(Xkuv) can be separated into three subsets like E1uv/k, E2uv/k and E3uv/k. As an example, the edges of E(Xk++) can be split into two parts like E1++/k={pqE(X)} and E2++/k={pe|the vertexpand edgeeinXare incident to each other} and the edges of E(Xk++) can be divided into three parts like E1++/k={pqE(X)}, E2++/k={pe|the vertex p and edge e in X are not incident to each other} and E3++/k={ef|e,fE(X)} (see Fig. 1).

Figure 1.

Figure 1

An example of Xk++: X2++ of a graph X(5,6) and its complement X2++.

3. The results on the F-index and its co-index of Xkuv

The following theorems can be used to compute the results on F-index and its co-index of the kth GTG Xkuv.

Theorem 1

Let X be a graph with n vertices and m edges. Then the F-index and its co-index of Xk++ are calculated as

  • (i)

    F(Xk++)=(k+1)3F(X)+8km.

  • (ii)

    F(Xk++)=(n+km1)(k+1)2M1(X)(k+1)3F(X)+4km(n+km3).

Proof

(i) From the definition of F-index, we have

F(Xk++)=pV(Xk++)d3(p/Xk++)=pV(Xk++)V(X)d3(p/Xk++)+pV(Xk++)E(X)d3(p/Xk++)

With the help of Table 1

=pV(X)((k+1)d(p/X))3+eE(X)23=(k+1)3F(X)+8km.

(ii) By applying the Proposition 2, Proposition 3, Table 1 and first part of Theorem 1, we get

F(Xk++)=(n1)M1(Xk++)F(Xk++), where n be the number of vertices of Xk++

=(n+km1)((k+1)2M1(X)+4km)((k+1)3F(X)+8km)=(n+km1)(k+1)2M1(X)(k+1)3F(X)+4km(n+km3).

 □

Table 1.

[21] The degree distributions of the point vertices and line vertices in Xkuv and Xkuv are corresponding to that vertices and edges in X.

Degrees of point vertices Degrees of line vertices Orders Sizes
d(p/Xk++)=(k+1)d(p/X) d(e/Xk++)=2 (km + n) (2k + 1)m
d(p/Xk+)=k(md(p/X))+d(p/X) d(e/Xk+)=(n2) (km + n) m + (n − 2)km
d(p/Xk+)=(k1)d(p/X)+(n1) d(e/Xk+)=2 (km + n) n(n − 1)/2 − m(1 − 2k)
d(p/Xk)=(n+km1)(k+1)d(p/X) d(e/Xk)=(n2) (km + n) (n − 2)mk + n(n − 1)/2 − m
d(p/Xk++)=n+km1(k+1)d(p/X) d(e/Xk++)=n+km3 (km + n) (n2)m+km(n2)+(mk2)
d(p/Xk+)=n1+(k1)d(p/X) d(e/Xk+)=(km+1) (km + n) (n2)m+2mk+(km2)
d(p/Xk+)=km(k1)d(p/X) d(e/Xk+)=n+km3 (km + n) m+km(n2)+(km2)
d(p/Xk)=(k+1)d(p/X) d(e/Xk)=(km+1) (km + n) m+2mk+(km2)

Corollary 1

Let X be a graph of order n and size m. Then

  • (i)

    F(Xk++)=3(n+km1)(k+1)2M1(X)(k+1)3F(X)+(n+km)(n+km1)36m(2k+1)(n+km1)2+12km(n+km1)8km.

  • (ii)

    F(Xk++)=(k+1)3F(X)2(n+km1)(k+1)2M1(X)+2m(2k+1)(n+km1)28km(n+km2).

Proof

(i) Using the Proposition 2, Proposition 3, Table 1 and Theorem 1, we have

F(Xk++)=n(n1)36m(n1)2+3(n1)M1(Xk++)F(Xk++), where n and m be the order and size of Xk++, respectively.

=(n+km)(n+km1)36m(2k+1)(n+km1)2+3(n+km1)((k+1)2M1(X)+4km)(k+1)3F(X)8km=3(n+km1)(k+1)2M1(X)(k+1)3F(X)+(n+km)(n+km1)36m(2k+1)(n+km1)2+12km(n+km1)8km.

(ii) Applying the Theorem 1, Table 1 and the Proposition 2, Proposition 3, we have

F(Xk++)=2m(2k+1)(n+km1)2(n+km1)M1(Xk++)F(Xk++)=2m(2k+1)(n+km1)2(n+km1)((k+1)2M1(X)+4km)(n+km1)(k+1)2M1(X)+(k+1)3F(X)4km(n+km3)=(k+1)3F(X)2(n+km1)(k+1)2M1(X)+2m(2k+1)(n+km1)28km(n+km2).

 □

The F-index and its co-index of Xk+ (see Fig. 2) are obtained in the following.

Figure 2.

Figure 2

An illustrate of Xk+: The 2nd GTG X2+ and its complement X2+.

Theorem 2

Let X be a graph of order n and size m. Then

  • (i)

    F(Xk+)=km(3(k1)2M1(X)6(k1)km2+m2k2n+(n2)3)(k1)3F(X).

  • (ii)

    F(Xk+)=(k1)3F(X)+(n2km1)(k1)2M1(X)+6m3k2(k1)nm3k3km(n2)3+km(n+km1)(nmk+4m4km+(n2)2).

Proof

(i) The F-index of Xk+ can be revealed as

F(Xk+)=pV(Xk+)d3(p/Xk+)=pV(Xk+)V(X)d3(p/Xk+)+pV(Xk+)E(X)d3(p/Xk+)=pV(Xk+)V(X)(k(md(p/X))+d(p/X))3+pV(Xk+)E(X)(n2)3=pV(X)((1k)3d3(p/X)+3km(k1)2d2(p/X)+3m2k2(1k)d(p/X)+m3k3)+(n2)3km=(1k)3F(X)+3km(k1)2M1(X)6m3k2(k1)+m3k3n+(n2)3mk.

(ii) With the help of Proposition 1, Proposition 2, Proposition 3, we can prove it in a similar way. □

Corollary 2

Consider X(n,m) be a graph and Xk+ be the complement of Xk+. Then

  • (i)

    F(Xk+)=(k1)3F(X)+3(n1)(k1)2M1(X)+(n+km)(n+km1)3nm3k3km(n2)36m((n2)k+1)(n+km1)2+3km(nkm+4m4km+(n2)2)(n+km1)+6m3k2(k1).

  • (ii)

    F(Xk+)=(k1)2(km2n+2)M1(X)(k1)3F(X)(n+2km)(n2)2km+2m((n2)k+1)(n+km1)22m2k(kn4k+4)(n+km1)+nm3k36m3k2(k1).

In the following, we obtain the F-index of the kth GTG Xk+ (see Fig. 3).

Theorem 3

Let X be an (n,m) graph. Then F-index and its co-index for Xk+ are given by

  • (i)

    F(Xk+)=(k1)3F(X)+3(k1)2(n1)M1(X)+n(n1)3+6m(n1)2(k1)+8km.

  • (ii)

    F(Xk+)=(km2n+2)(k1)2M1(X)(k1)3F(X)+2m(n1)(k1)(2kmn+1)+km(n32n2+4km+5n12).

Figure 3.

Figure 3

An illustrate of Xk+: The 2nd GTG X2+ and its complement X2+.

Proof

(i) We get from the definition of F-index

F(Xk+)=pV(Xk+)d3(p/Xk+)=pV(Xk+)V(X)d3(p/Xk+)+pV(Xk+)E(X)d3(p/Xk+)=pV(Xk+)V(X)((k1)d(p/X)+(n1))3+pV(Xk+)E(X)23=pV(X)((k1)d3(p/X)+(n1)3+3(k1)2(n1)d2(p/X)+3(n1)2(k1)d(p/X))+8km=(k1)3F(X)+n(n1)3+3(k1)2(n1)M1(X)+6m(n1)2(k1)+8km.

(ii) From Theorem 3, Table 1 and Proposition 1, Proposition 2, Proposition 3 we can get the required expression. □

Corollary 3

Let us consider X be a graph with n vertices and m edges and Xk+ be the complement of the graph Xk+. Then

  • (i)

    F(Xk+)=3km(k1)2M1(X)(k1)3F(X)+(n+km)(n+km1)36m(n1)2(k1)3(n2+4kmn2m)(n+km1)2+12m(knn+1)(n+km1)+n(n1)2(2n+3km2)8km.

  • (ii)

    F(Xk+)=(k1)3F(X)+(k1)2(n2km1)M1(X)+(n2+4kmn2m)(n+km1)22m(n1)(k1)(4k+n1)n(n1)2(2km+n1)8km(km+n2).

The F-index and its co-index of Xk (see Fig. 4) are obtained in the following.

Figure 4.

Figure 4

An illustrate of Xk: The 2nd GTG X2 and its complement X2.

Theorem 4

The F-index and its co-index for the kth GTG Xk are expressed as

  • (i)

    F(Xk)=n(n+km1)3(k+1)3F(X)+3(n+km1)(k+1)2M1(X)+km(n2)36m(k+1)(n+km1).

  • (ii)

    F(Xk)=(k+1)3F(X)2m(k+1)(n+km1)(2km+2n5)+km(km+1)(n2)22(n+km1)(k+1)2M1(X).

Proof

(i) From the definition of F-index, we get

F(Xk)=pqE(Xk)(d2(p/Xk)+d2(q/Xk))=pqE(X)[{(n+km1)(k+1)d(p/X)}2+{(n+km1)(k+1)d(q/X)}2]+pV(X)k(md(p/X))[{(n+km1)(k+1)d(p/X)}2+(n2)2]=pqE(X)[2(n+km1)22(k+1)(n+km1)(d(p/X)+d(q/X))+(k+1)2(d2(p/X)+d2(q/X))]+pV(X)k(md(p/X))[(n+km1)2+(n2)22(k+1)(n+km1)d(p/X)+(k+1)2d2(p/X)]=2(n+km1)2((n2)m)2(k+1)(n+km1)M1(X)+(k+1)2F(X)+kmn(n+km1)2+kmn(n2)24m2k(k+1)(n+km1)+km(k+1)2M1(X)2km(n+km1)22km(n2)2+2k(k+1)(n+km1)M1(X)k(k+1)2F(X)=n(n+km1)3(k+1)3F(X)+3(n+km1)(k+1)2M1(X)6m(k+1)(n+km1)+km(n2)3.

(ii) With the help of the Proposition 2, Proposition 3, we can write

F(Xk)=(n+km1)M1(Xk)F(Xk)

Using the results of M1(Xk) and F(Xk)

=(n+km1){n(n+km1)24m(k+1)(n+km1)+(k+1)2M1(X)+km(n2)2}{n(n+km1)3(k+1)3F(X)+3(k+1)2(n+km1)M1(X)6m(k+1)(n+km1)+km(n2)3}=(k+1)3F(X)2m(k+1)(n+km1)(2km+2n5)+km(km+1)(n2)22(n+km1)(k+1)2M1(X).

 □

Corollary 4

Let us consider X be a graph with n vertices and m edges and Xk be the complement of the graph Xk. Then

  • (i)

    F(Xk)=(k+1)3F(X)+(3n+km)(n+km1)33(n2+2kmn+2mn)(n+km1)2+6m(k+1)(n+km1)+km(2n+3km1)(n2)2.

  • (ii)

    F(Xk)=(n+km1)(k+1)2M1(X)(k+1)3F(X)km(n+2km)(n2)2n(n+km1)3+(n2+2kmnn+2m)(n+km1)2+2m(k+1)(2km+2n5).

4. The Zagreb polynomials on Xk++

In chemical graph theory, the Zagreb polynomial is one of the degree graph polynomials. In 2009, Fath-Tabar [12] introduced the Zagreb polynomials. The Zagreb polynomials for the graph Xk++ are computed in the following Theorems and Corollaries.

Theorem 5

Let X be a graph of order n and size m. Then the Zagreb polynomials of Xk++ are follows as

  • (i)

    M1(Xk++,x)=M1(X,x(k+1))+x2kM1(X,x(k+1)).

  • (ii)

    M2(X++,x)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+x2(n+km1)kM1(X,x(k+1)).

  • (iii)

    M3(Xk++,x)=M3(X,x(k+1))+kmx2M0(X,x(k+1))kx2M1(X,x(k+1))+(km2).

Proof

(i) The M1(Xk++,x) polynomial can be expressed as

M1(Xk++,x)=pqE(Xk++)x(d(p/Xk++)+d(q/Xk++)).

The edges of E(Xk++) can be divided into two parts like E1++/k={pqE(X)} and E2++/k={pe|the vertex p and edge e in X are incident to each other} such that |E1++/k|=m and |E2++/k|=2km, respectively.

=pqE1++/kx(k+1)(d(p/X)+d(q/X))+peE2++/kx(k+1)d(p/X)+2 (Using Table 1)=M1(X,x(k+1))+x2kpV(X)d(p/X)x(k+1)d(p/X)=M1(X,x(k+1))+x2kM1(X,x(k+1)).

(ii) Now,

M2(Xk++,x)=pqE(Xk++)xd(p/Xk++)d(q/Xk++)=pqE(X)x((n+km1)(k+1)d(p/X))((n+km1)+d(q/X))+peE2++/kx2((n+km1)(k+1)d(p/X))=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+x2(n+km1)kpV(X)d(p/X)x(k+1)d(p/X)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+x2(n+km1)kM1(X,x(k+1)).

(iii) From the definition of M3(X,x) and putting X=Xk++, we have

M3(Xk++,x)=pqE(Xk++)x|d(p/Xk++)d(q/Xk++)|=pqE(X)x|(k+1)d(p/X)(k+1)d(q/X)|+peE2++/kx|(k+1)d(p/X)|2+efE3++/kx0=M3(X,x(k+1))+kx2pV(X)(md(p/x))x(k+1)d(p/X)+(km2)=M3(X,x(k+1))+kmx2M0(X,x(k+1))kx2M1(X,x(k+1))+(km2).

 □

Corollary 5

The Zagreb polynomials for the graph Xk++ are expressed as

  • (i)

    M1(Xk++,x)=x2(n+km1)M1(X,x(k+1))+kmx2(n+km2)M0(X,x(k+1))kx2(n+km2)M1(X,x(k+1))+(km2)x2(n+km3).

  • (ii)

    M2(Xk++,x)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+kmx(n+km1)(n+km3)×M0(X,x(k+1)(n+km3))tx(n+km1)(n+km3)M1(X,x(k+1)(n+km3))+(km2)x(n+km3)2.

  • (iii)

    M3(Xk++,x)=M3(X,x(k+1))+kmx2M0(X,x(k+1))kx2M1(X,x(k+1))+(km2).

Proof

(i) The edges of E(Xk++) can be partitioned into three parts such as E1++/k={pqE(X)}, E2++/k={pe|the vertex p and edge e in X are not incident to each other} and E3++/k={ef|e,fE(X)} such that |E1++/k|=(n2)m, |E2++/k|=km(n2) and |E3++/k|=(km2), respectively.

By the definition of the polynomial M1(X,x) and setting X=Xk++, we get

M1(Xk++,x)=pqE(Xk++)xd(p/Xk++)+d(q/Xk++)=pqE1++/kxd(p/Xk++)+d(q/Xk++)+peE2++/kxd(p/Xk++)+d(q/Xk++)+efE3++/kxd(p/Xk++)+d(q/Xk++)=pqE(X)x[2(n+km1)(k+1)(d(p/X)+d(q/X))]+peE2++/kx2(n+km2)(k+1)d(p/X)+efE3++/kx2(n+km3)=x2(n+km1)pqE(X)x(k+1)(d(p/X)+d(q/X))+kpV(X)(md(p/X))x2(n+km2)(k+1)d(p/X)+(km2)x2(n+km3)=x2(n+km1)M1(X,x(k+1))+kmx2(n+km2)M0(X,x(k+1))kx2(n+km2)M1(X,x(k+1))+(km2)x2(n+km3).

(ii) From definition, we have

M2(Xk++,x)=pqE(Xk++)xd(p/Xk++)d(q/Xk++)=pqE1++/kxd(p/Xk++)d(q/Xk++)+peE2++/kxd(p/Xk++)d(e/Xk++)+efE3++/k)xd(e/Xk++)d(f/Xk++)=pqE(X)x(n+km1(k+1)d(p/X))(n+km1(k+1)d(q/X))+efE(E3++/k)x(n+km3)2+x(n+km1)(n+km3)kpV(X)(md(p/X))x(k+1)(n+km3)d(p/X)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+kmx(n+km1)(n+km3)M0(X,x(k+1)(n+km3))+(km2)x(n+km3)2kx(n+km1)(n+km3)M1(X,x(k+1)(n+km3)).

(iii) Now,

M3(Xk++,x)=pqE(Xk++)x|d(p/Xk++)d(q/Xk++)|=pqE(X1++/k)x|d(p/Xk++)d(q/Xk++)|+peE(X2++/k)x|d(p/Xk++)d(e/Xk++)|+efE(X3++/k)x|d(e/Xk++)d(f/Xk++)|=pqE(X)x(k+1)|d(p/X)d(q/X)|+kpV(X)(md(p/X))x|(n+km1)(k+1)d(p/X)(n+km3)|+efE(X3++)x0=M3(X,x(k+1))+kmx2M0(X,x(k+1))kx2M1(X,x(k+1))+(km2).

 □

Corollary 6

  • (i)

    M1(Xk++,x)=M1(X,x(k+1))+kmx2M0(X,x(k+1))x2kM1(X,x(k+1))+(km2)x4.

  • (ii)

    M2(Xk++,x)=M2(X,x(k+1)2)+mkM0(X,x2(k+1))kM1(X,x2(k+1))+(km2)x4.

  • (iii)

    M3(Xk++,x)=M3(X,x(k+1))+kmx2M0(X,x(k+1))kx2M1(X,x(k+1))+(km2).

Proof

(i)

M1(Xk++,x)=pqE(Xk++)x(d(p/Xk++)+d(q/Xk++))=pqE1++/kx(k+1)(d(p/X)+d(q/X))+peE2++/kx(k+1)d(p/X)+2+efE3++/kx4

The partition of the edge set E(Xk++) follows as Corollary 5

=pqE(X)x(k+1)(d(p/X)+d(q/X))+x2kpV(X)(md(p/X))x(k+1)d(p/X)+(mk2)x4=M1(X,x(k+1))+x2k[mM0(X,x(k+1))M1(X,x(k+1)]+(mk2)x4.

(ii)

M2(Xk++,x)=pqE(Xk++)xd(p/Xk++)d(q/Xk++)=pq(E1++/k)xd(p/Xk++)d(q/Xk++)+pe(E2++/k)xd(p/Xk++)d(e/Xk++)+ef(E3++/k)xd(e/Xk++)d(f/Xk++)=pqE(X)x(k+1)2d(p/X)d(q/X)+kpV(X)(md(p/X))x2(k+1)d(p/X)+ef(E3++/k)x4=M2(X,x(k+1)2)+k(mM0(X,x2(k+1))M1(X,x2(k+1)))+(km2)x4.

(iii)

M3(Xk++,x)=pqE(Xk++)x|d(p/Xk++)d(q/Xk++)|=pq(E1++/k)x|d(p/Xk++)d(q/Xk++)|+pe(E2++/k)x|d(p/Xk++)d(e/Xk++)|+ef(E3++/k)x|d(e/Xk++)d(f/Xk++)|=pqE(X)x|(k+1)d(p/X)(k+1)d(q/X)|+kx2pV(X)(md(p/X))x(k+1)d(p/X)+(km2)=M3(X,x(k+1))+kmx2M0(X,x(k+1))kx2M1(X,x(k+1))+(km2).

 □

Corollary 7

  • (i)

    M1(Xk++,x)=x2(n+km1)M1(X,x(k+1))+kx2(n+km2)M1(X,x(k+1)).

  • (ii)

    M2(Xk++,x)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+kx(n+km1)(n+km3)×M1(X,x(k+1)(n+km3)).

  • (iii)

    M3(Xk++,x)=M3(X,x(k+1))+kx2M1(X,x(k+1)).

Proof

(i) With the help of the definition M1(X,x) and putting X=Xk++, we get

M1(Xk++,x)=pqE(Xk++)x(d(p/Xk++)+d(q/Xk++))=pqE(X)x(n+km1(k+1)d(p/X)+n+km1(k+1)d(q/x))+kpV(X)d(p/X)x(n+km1(k+1)d(p/X)+n+km3)=x2(n+km1)M1(X,x(k+1))+kx2(n+km2)M1(X,x(k+1)).

(ii)

M2(Xk++,x)=pqE(Xk++)x(d(p/Xk++)d(q/Xk++))=pqE(X)x(n+km1(k+1)d(p/X))(n+km1(k+1)d(q/x))+kpV(X)d(p/X)x(n+km1(k+1)d(p/X))(n+km3)=pqE(X)x(k+1)2(d(p/X)(n+km1)(k+1))(d(q/X)(n+km1)(k+1))+kx(n+km1)(n+km3)pV(X)d(p/X)x(n+km1)(k+1)d(p/X)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+kx(n+km1)(n+km3)M1(X,x(k+1)(n+km3)).

(iii)

M3(Xk++,x)=pqE(Xk++)x|d(p/Xk++)d(q/Xk++)|=pqE(X)x|(k+1)d(p/X)(k+1)d(q/X)|+kx2pV(X)d(p/X)x(k+1)d(p/X)=M3(X,x(k+1))+kx2M1(X,x(k+1)).

 □

5. The Zagreb polynomials on Xk+

The expressions for the Zagreb polynomials of the kth GTG Xk+ are obtained as follows here.

Theorem 6

For the kth GTG Xk+, the Zagreb polynomials are

  • (i)

    M1(Xk+,x)=x2kmM1(X,x(k1))+kmx(n+km2)M0(X,x(k1))kx(n+km2)M1(X,x(k1)).

  • (ii)

    M2(Xk+,x)=Mkm(k1),km(k1)(X,x(k1))+kmx(n2)kmM0(X,x(n2)(k1))kx(n2)kmM1(X,x(n2)(k1)).

  • (iii)

    M3(Xk+,x)=M3(X,x(k1))+kmx|nkm2|M0(X,x(k1))kx|nkm2|M1(X,x(k1)).

Proof

(i) The edges of E(Xk+) can be separated into two parts like E1+/k={pqE(X)} and E2+/k={pe|the vertex p and edge e are not incident to each other inX} such that |E1+/k|=m and |E2+/k|=km(n2), respectively.

By the definition of M1(X,x) and putting X=Xk+, we have

M1(Xk+,x)=pqE(Xk+)x(d(p/Xk+)+d(q/Xk+))=pqE1+/kx2km(k1)(d(p/X)+d(q/X))+peE2+/kxkm+n2(k1)d(p/X)(Using Table 1)=x2kmpqE(X)x(k1)(d(p/X)+d(q/X))+kx(km+n2)pV(X)(md(p/X))x(k1)d(p/X)=x2kmM1(X,x(k1))+kmx(n+km2)M0(X,x(k1))kx(n+km2)M1(X,x(k1)).

The rest part of the theorem can be established in a similar way. □

Corollary 8

  • (i)

    M1(Xk+,x)=x2(n1)M1(X,x(k1))+kx(n+km)M1(X,x(k1))+(mk2)x2(km+1).

  • (ii)

    M2(Xk+,x)=M(n1)(k1),(n1)(k1)(X,x(k1)2)+kx(n1)(km+1)M1(X,x(k1)(km+1))+(km2)x(km+1)2.

  • (iii)

    M3(Xk+,x)=M3(X,x(k1))+kx|nkm2|M1(X,x(k1))+(km2).

Proof

(i) The edges of E(Xk+) can be divided into three parts such as E1+/k={pqE(X)}, E2+/k={pe|the vertex p is incident to the edge e in X } and E3+/k={ef|e,fE(X)} such that |E1+/k|=(n2)m, |E2+/k|=2km and |E3+/k|=(km2), respectively.

By the definition of the polynomial M1(X,x) and setting X=Xk+, we get

M1(Xk+,x)=pqE(Xk+)xd(p/Xk+)+d(q/Xk+)=pqE1+/kxd(p/Xk+)+d(q/Xk+)+peE2+/kxd(p/Xk+)+d(q/Xk+)+efE3+/kxd(p/Xt+k)+d(q/Xk+)=pqE(X)x[2(n1)+(k1)(d(p/X)+d(q/X))]+peE2+/kx(n+km)+(k1)d(p/X)+efE3+/kx2(km+1)=x2(n1)pqE(X)x(k1)(d(p/X)+d(q/X))+kpV(X)d(p/X)x(n+km)+(k1)d(p/X)+efE3+/kx2(km+1)=x2(n1)M1(X,x(k1))+kx(n+km)M1(X,x(k1))+(km2)x2(km+1).

Similarly, we can prove the rest Corollary 8. □

Corollary 9

  • (i)

    M1(Xk+,x)=x2kmM1(X,x(k1))+kx(n+km2)M1(X,x(k1))+(mk2)x2(n2).

  • (ii)

    M2(Xk+,x)=Mkm(k1),km(k1)(X,x(k1)2)+kx(n2)kmM1(X,x(n2)(k1))+(km2)x(n2)2.

  • (iii)

    M3(Xk+,x)=M3(X,x(k1))+kx|nkm2|M1(X,x(k1))+(km2).

Corollary 10

  • (i)

    M1(Xk+,x)=x2(n1)M1(X,x(k1))+kmx(n+km)M0(X,x(k1))kx(n+km)M1(X,x(k1)).

  • (ii)

    M2(Xk+,x)=M(n1)(k1),(n1)(k1)(X,x(k1)2)+kmx(n1)(km+1)M0(X,x(k1))(km+1))kx(n1)(km+1)M1(X,x(k1)(km+1)).

  • (iii)

    M3(Xk+,x)=M3(X,x(k1))+kx|nkm2|M1(X,x(k1)).

6. The Zagreb polynomials on Xk+

The Xk+ is a one kind of the kth GTG of X. The F-index and its co-index and also the Zagreb polynomials for the Xk+ and its complements are obtained in the following theorems.

The two parts of the edges E(Xk+) are E1+/k={pqE(X)} and E2+/k={pe|the vertex p and edge e in X are incident to each other} such that |E1+/k|=(n2)m and |E2+/k|=2km, respectively. Analogously,

E(Xk+)=E1+/kE2+/kE3+/k.

Also, |E1+/k|=m, |E2+/k|=km(n2) and |E3+/k|=(km2), respectively.

Theorem 7

The Zagreb polynomials of Xk+ are given by

  • (i)

    M1(Xk+,x)=x2(n1)M1(X,x(k1))+kx(n+1)M1(X,x(k1)).

  • (ii)

    M2(Xk+,x)=M(n1)(k1),(n1)(k1)(X,x(k1)2)+kx2(n1)M1(X,x2(k1)).

  • (iii)

    M3(Xk+,x)=M3(X,x(k1))+kx|n3|M1(X,x(k1)).

Corollary 11

  • (i)

    M1(Xk+)=x2kmM1(X,x(k1))+kmx(n+2km3)M0(X,x(k1))+(km2)x2(n+km3)kx(n+2km3)M1(X,x(k1)).

  • (ii)

    M2(Xk+)=Mkm(k1),km(k1)(X,x(k1)2)+kmxkm(n+km3)M0(X,x(k1)(n+km3))+(km2)x(n+km3)2kxkm(n+km3)M1(X,x(k1)(n+km3)).

  • (iii)

    M3(Xk+)=M3(X,x(k1))+kmx|n3|M0(X,x(k1))kx|n3|M1(X,x(k1))+(km2).

Corollary 12

  • (i)

    M1(Xk+,x)=x2(n1)M1(X,x(k1))+kmx(n+1)M0(X,x(k1))kx(n+1)M1(X,x(k1))+(km2)x4.

  • (ii)

    M2(Xk+,x)=M(n1)(k1),(n1)(k1)(X,x(k1)2)+kmx2(n1)M0(X,x2(k1))kx2(n1)M1(X,x2(k1))+(km2)x4.

  • (iii)

    M3(Xk+,x)=M3(X,x(k1))+kmx|n3|M0(X,x(k1))kx|n3|×M1(X,x(k1))+(km2).

Corollary 13

  • (i)

    M1(Xk+,x)=x2kmM1(X,x(k1))+kx(n+2km3)M1(X,x(k1)).

  • (ii)

    M2(Xk+,x)=Mkm(k1),km(k1)(X,x(k1)2)+kxkm(n+km3)M1(X,x(k1)(n+km3)).

  • (iii)

    M3(Xk+,x)=M3(X,x(k1))+kx|n3|M1(X,x(k1)).

7. The Zagreb polynomials on Xk

There exist four kth GTG of a graph for the 2-permutation of {+,}. The Xk is one kind of that four graphical transformations of the graph X.

The two subset of the edge set E(Xk) are E1/k={pqE(X)} and E2/k={pe|the vertex p is not incident to the edge e in X} where |E1/k|=(n2)m and |E2/k|=km(n2), respectively. Similarly,

E(Xk)={E1/k=pqE(X)}{E2/k=pe|the vertex p is incident to the edge e in X}{E3/k=ef|e,fE(X)}.

Also, |E1/k|=m, |E2/k|=2km and |E3/k|=(km2), respectively.

Theorem 8

  • (i)

    M1(Xk,x)=x2(n+km1)M1(X,x(k+1))+kmx(2n+km3)M0(X,x(k+1))kx(2n+km3)M1(X,x(k+1)).

  • (ii)

    M2(Xk,x)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+kmx(n2)(n+km1)×M0(X,x(n2)(k+1))kx(n2)(n+km1)M1(X,x(n2)(k+1)).

  • (iii)

    M3(Xk,x)=M3(X,x(k+1))+kmx|km+1|M0(X,x(k+1))kx|km+1|×M1(X,x(k+1)).

Corollary 14

  • (i)

    M1(Xk,x)=M1(X,x(k+1))+kx(km+1)M1(X,x(k+1))+(km2)x2(km+1).

  • (ii)

    M2(Xk,x)=M2(X,x(k+1)2)+kM1(X,x(k+1)(km+1))+(km2)x(km+1)2.

  • (iii)

    M3(Xk,x)=M3(X,x(k+1))+kx|km+1|M1(X,x(k+1))+(km2).

Corollary 15

  • (i)

    M1(Xk,x)=x2(n+km1)M1(X,x(k+1))+kx(2n+km3)M1(X,x(k+1))+(km2)x2(n2).

  • (ii)

    M2(Xk,x)=M(n+km1)(k+1),(n+km1)(k+1)(X,x(k+1)2)+kx(n2)(n+km1)×M1(X,x(n2)(k+1))+(km2)x(n2)2.

  • (iii)

    M3(Xk,x)=M3(X,x(k+1))+kx|km+1|M1(X,x(k+1))+(km2).

Corollary 16

  • (i)

    M1(Xk,x)=M1(X,x(k+1))+kmx(km+1)M0(X,x(k+1))kx(km+1)×M1(X,x(k+1)).

  • (ii)

    M2(Xk,x)=M2(X,x(k+1)2)+kmM0(X,x(k+1)(km+1))kM1(X,x(k+1)(km+1)).

  • (iii)

    M3(Xk,x)=M3(X,x(k+1))+kmx|km+1|M0(X,x(k+1))kx|km+1|M1(X,x(k+1)).

8. Conclusion

In this paper, we present some explicit expressions for the F-index (and co-index) of the kth generalized transformation graphs of a molecular graph in terms of various graph invariants. Also, some figures are constructed to show their changes under different kth generalized transformation graphs. The Zagreb polynomials, its co-polynomials and their complements are determined for the same transformation graphs. This work will help researchers working in the field of chemical graph theory that has many applications in chemical engineering. In future, we would like to consider a significant extension of the existing work in the literature for many other topological indices and their corresponding polynomials.

Declarations

Author contribution statement

D. Maji: Conceived and designed the analysis; Analyzed and interpreted the data; Contributed analysis tools or data; Wrote the paper.

G. Ghorai: Conceived and designed the analysis; Analyzed and interpreted the data; Contributed analysis tools or data.

Funding statement

This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors.

Data availability statement

No data was used for the research described in the article.

Declaration of interests statement

The authors declare no conflict of interest.

Additional information

No additional information is available for this paper.

Acknowledgements

We are highly thankful to the honorable reviewers for their valuable comments and helpful suggestions.

References

  • 1.Harary F. Addison-Wesley Publishing Co.; Reading, Mass. Melto Park, Calif Londan: 1969. Graph Theory. [Google Scholar]
  • 2.Gutman I., Ruscic B., Trinajstic N., Wilcox C.F. Graph theory and molecular orbitals. XII. Acyclic polyenes. J. Chem. Phys. 1975;62(9):3399–3405. [Google Scholar]
  • 3.Gutman I., Trinajstic N. Graph theory and molecular orbitals. Total ϕ-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972;17(4):535–538. [Google Scholar]
  • 4.Doslic T. Vertex–weighted Wiener polynomials for composite graphs. Ars Math. Contemp. 2008;1:66–80. [Google Scholar]
  • 5.Furtula B., Gutman I. A forgotten topological index. J. Math. Chem. 2015;53(4):1184–1190. [Google Scholar]
  • 6.De N., Nayeem S.M.A., Pal A. The F-coindex of some graph operations. SpringerPlus. 2016;5:221. doi: 10.1186/s40064-016-1864-7. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 7.Wu B., Meng J. Basic properties of total transformation graphs. J. Math. Study. 2001;34(2):109–116. [Google Scholar]
  • 8.De N. F-index of total transformation graphs. Contemp. Stud. Discrete Math. 2018;2(2):1–10. [Google Scholar]
  • 9.Roshini G.R., Chandrakala S.B., Sooryanarayana B. Some degree based topological indices of transformation graphs. Bull. Int. Math. Virtual Inst. 2020;10(2):225–237. [Google Scholar]
  • 10.Roshini G.R., Chandrakala S.B., Sooryanarayana B. Randic index of transformation graphs. Int. J. Pure Appl. Math. 2018;120(6):6229–6241. [Google Scholar]
  • 11.Maji D., Ghorai G. A novel graph invariant: the third leap Zagreb index under several graph operations. Discrete Math. Algorithms Appl. 2019;11(5):1–16. [Google Scholar]
  • 12.Fath-Tabar G. Zagreb polynomial and Pi indices of some nanostructures. Digest J. Nanomater. Biostruct. 2009;4(1):189–191. [Google Scholar]
  • 13.Basavanagoud B., Jakkannavar P. On the Zagreb polynomials of transformation graphs. Int. J. Sci. Res. Math. Stat. Sci. 2018;5(6):328–335. [Google Scholar]
  • 14.Shuxian L. Zagreb polynomials of thorn graphs. Kragujev. J. Sci. 2011;33:33–38. [Google Scholar]
  • 15.Bindusree A.R., Cangul I.N., Lokesha V., Cevik A.S. Zagreb polynomials of three graph operators. Filomat. 2016;30(7):1979–1986. [Google Scholar]
  • 16.Basavanagoud B., Desai V.R. Forgotten topological index and hyper Zagreb index of generalized transformation graphs. Bull. Math. Sci. Appl. 2016;14:1–6. [Google Scholar]
  • 17.De N., Nayeem S.M.A., Pal A. The F-index of some graph operations. Discrete Math. Algorithms Appl. 2016;8(2) [Google Scholar]
  • 18.Basavanagoud B., Gutman I., Desai V.R. Zagreb indices of generalized transformation graphs and their complements. Kragujev. J. Sci. 2015;37:99–112. [Google Scholar]
  • 19.Kang S.M., Yousaf M., Zahid M.A., Younas M., Nazeer W. Zagreb polynomials and redefined Zagreb indices of nanostar dendrimers. Open Phys. 2019;17(1):31–40. [Google Scholar]
  • 20.Gutman I., Furtula B., Vukicevic Z.K., Popivoda G. On Zagreb indices and coindices. MATCH Commun. Math. Comput. Chem. 2015;74(1):5–16. [Google Scholar]
  • 21.Jummannaver R., Narayankar K., Selvan D. Zagreb and coindex of kth generalized transformation graphs. Bull. Int. Math. Virtual Inst. 2020;10(2):389–402. [Google Scholar]
  • 22.Ramane H.S., Jummannaver R.B., Sedghi S. Some degree based topological indices of generalized transformation graphs and their complements. Int. J. Pure Appl. Math. 2016;109(3):493–509. [Google Scholar]
  • 23.Sampathkumar E., Chikkodimath S.B. Semi-total graphs of a graph. J. Karnatak Univ., Sci. 1973;18:274–280. [Google Scholar]
  • 24.Jog S.R., Hande S.P., Gutman I., Bozkurt S.B. Derived graphs of some graphs. Kragujev. J. Math. 2012;36(2):309–314. [Google Scholar]
  • 25.Hosamani S.M., Gutman I. Zagreb indices of transformation graphs and total transformation graphs. Appl. Math. Comput. 2014;247:1156–1160. [Google Scholar]
  • 26.Mirajkar K.G., Priyanka Y.B. On the Zagreb index and coindex of generalized transformation graphs Gab. Int. J. Pure Appl. Math. 2016;109(9):167–175. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

No data was used for the research described in the article.


Articles from Heliyon are provided here courtesy of Elsevier

RESOURCES