Some Invariants of Flower Graph

Open access

Abstract

Let G be a graph and let mij(G), i, j ≥ 1, represents the number of edge of G, where i and j are the degrees of vertices u and v respectively. In this article, we will compute different polynomials of flower graph f(n×m), namely M polynomial and Forgotten polynomial. These polynomials will help us to find many degree based topological indices, included different Zagreb indices, harmonic indices and forgotten index.

Abstract

Let G be a graph and let mij(G), i, j ≥ 1, represents the number of edge of G, where i and j are the degrees of vertices u and v respectively. In this article, we will compute different polynomials of flower graph f(n×m), namely M polynomial and Forgotten polynomial. These polynomials will help us to find many degree based topological indices, included different Zagreb indices, harmonic indices and forgotten index.

1 Introduction

In discrete mathematics, graph theory in general, not only the study of different properties of objects but it also tells us about objects having same properties as investigating object. These properties of different objects if of main interest. In particular, graph polynomials related to graph are rich in information about subgraph of investigating graph. Mathematical tools like polynomials and topological based numbers play an important rule, these tools gives important information about properties of chemical compounds. We can find out many hidden information about compounds through theses tools. Multifold graph polynomials are present in literature, various of them turned out to be applicable in mathematical chemistry. Actually, topological index is a numeric quantity that tells us about the whole structure of graph. Commonly used topological indices are degree-based and distance-based topological indices. Theses tools helps us to study physical, chemical reactivities and biological properties [1, 2, 3, 4, 5]. In 1947, Winner, firstly introduce the concept of topological index while working on boiling point. In particular, Hosoya polynomial [6] palys an important in the area if distance-based topological indices, we can find out Winer index, Hyper winer index and Tratch-stankevich-zefirove index by Hosoya polynomial. Another important degree-based polynomial is M-polynomial [7] that was introduced by Emeric Deutsch and Sandi Klavaza in 2015. Mainly, M-polynomial helps us to gain many information related to degree based topological indices. [8, 9, 10, 11].

Definition 1. If G=(V,E) is a graph and vɛV, the dv(G) denoted the degree of v. Let mij(G), i, j ≥ 1, be the number of edges uv of G such that {dv(G),du(G)} = {i, j}. The M-polynomial [7] is defined as

M(G;x,y)=ijmij(G)xiyj

The firstly introduced topological index was Winer index [12], some one named this winer index path number. While studying chemical graph structures, commonly studied index in winer index because of having huge number of application in chemical graph theory [13], [14]. Another oldest topological index is Randic index introduced by Milan Randic in 1975. The Randic index [15] is defined as:

R12(G)=uvϵE(G)1dudv

After some time Ballobas and Erdos [16] in 1998,and Amic et al. [17] gives the concept of generalized Randic index. Mathematicians and chemists gain many results from this concept [18]. Many results related to generalized randic index have been discussed in [19].

Ghorbani and Azimi [21] in 2012, introduced two new variants of zagreb indices

Definition 2. The first multiple Zagreb index of a graph G can be defined as:

PM1(G)=uvϵE(G)[du+dv]

Definition 3. The second multiple Zagreb index of a graph G is:

PM2(G)=uvϵE(G)[du.dv]

Definition 4. The first Zagreb polynomial of a graph G is:

M1(G,x)=ΣuvϵE(G)x[du+dv]

Definition 5. The second Zagreb polynomial of a graph G is:

M1(G,x)=ΣuvϵE(G)x[du.dv]

Definition 6. [22] The first and second Zagreb Coindices are define as,

M1¯=M1¯(G)=xyE(G)[d(x)+d(y)]M2¯=M2¯(G)=xyE(G)[d(x).d(y)]

Definition 7. [?] F-Coindex can be define as

F¯(G)=xyE(G)[d(x)2+d(y)2]
Fig. 1

Download Figure

Fig. 1

Flower Graphs f8×4 and f4×6

Citation: Applied Mathematics and Nonlinear Sciences 3, 2; 10.21042/AMNS.2018.2.00033

2 Main Result

Here, we will compute different polynomials of flower graph f(n×m), namely, M-Polynomial, Forgotten Polynomials and with the help of these polynomials, we will discuss different variants of Flower graph f(n×m).

Theorem 1

Let f(n×m) be Flower graph, where n = {0,1,2,⋯} and m = {0,1,2,⋯}. Then the M-polynomial is

M(f(n×m);x,y)=n(m3)x2y2+2nx2y4+nx4y4

Proof. For Flower graph f(n×m). The vertex set and edge sets are respectively, |V(f(n×m))| = n(m-1) and |E(f(n×m))| = nm The possible vertex degrees are 2 and 4, the contributed edges are (2,2) (2,4) and (4,4). From above condition, we can divided edge set of f(n×m) into three partitions,

E1f(n×m)={e=uvϵE(f(n×m));du=2,dv=2}E2f(n×m)={e=uvϵE(f(n×m));du=2,dv=4}E3f(n×m)={e=uvϵE(f(n×m));du=4,dv=4}

where, |E1(f(n×m))| = n(m-3), |E2(f(n×m))| = n, |E3(f(n×m))| = 2n

From the definition of M-polynomial, we have

M(f(n×m);x,y)=ijmij(G)xiyj
M(f(n×m);x,y)=22m22(G)x2y2+24m24(G)x2y4+44m44(G)x4y4
M(f(n×m);x,y)=uvϵE1(fn×m)m22(G)x2y2+uvϵE2(fn×m)m24(G)x2y4+uvϵE3(fn×m)m44(G)x4y4
M(f(n×m);x,y)=|E1f(n×m)|x2y2+|E2f(n×m)|x2y4+|E3f(n×m)|x4y4
M(f(n×m);x,y)=n(m3)x2y2+2nx2y4+nx4y4

Proposition 2. Let f(n×m) be Flower graph, where n = {0,1,2, ⋯} and m = {0,1,2,⋯}. Then the Forgotten Polynomial and Forgotten Index / F-index is given as, respectively,

F(f(n×m),x)=n(m3)x8+nx32+2nx20F(f(n×m))=8mn+48n

Proposition 3. Let f(n×m) be a flower graph. Then,

M1(f(n×m))=4mn+8n
M2(f(n×m))=4mn+20n
M2(f(n×m))=14mn716n
Rα(f(n×m))=22αmn+(22α+2(α+1)3)22αn
RRα(f(n×m))=2(2α)mn+(2(α+1).4α2(2α).3+4(2α))n
SSD(f(n×m))=2mn+2
H(f(n×m))=14mn724n
I(f(n×m))=mn+53n
A(f(n×m))=23mn+(2523.3+2.3(3).44)n

Proof. If

M(f(n×m);x,y)=n(m3)x2y2+2nx2y4+nx4y4

then,

Dxf(x,y)=2n(m3)x2y2+4nx2y4+4nx4y4DxDyf(x,y)=4n(m3)x2y2+16nx2y4+16x4y4SxSyf(x,y)=14n(m3)x2y2+14nx2y4+116nx4y4SxαSyαf(x,y)=2(2α)n(m3)x2y2+2(α+1).4αnx2y4+4(2α)nx4y42SxJ(x,y)=14n(m3)x4+13nx6+18nx8SxJDxDy(x,y)=n(m3)x4+83nx6+2nx8Dx3Dy3f(x,y)=26n(m3)x2y2+23.44nx2y4+46nx4y4JDx3Dy3f(x,y)=26n(m3)x4+23.44nx6+46nx8Q(n2)JDx3Dy3f(x,y)=26n(m3)x2+23.44nx4+46nx6Sx3Q(n2)JDx3Dy3f(x,y)=23n(m3)x2+23.4nx4+46.6(3)nx6

2.1 Degree Based Topological Index

In this section, we will discuss different variants of flower graph fn×m with the help of M-polynomial, Forgotten polynomial and F-index.

  • First Zagreb Index M1(f(n×m))

(Dx+Dy)(fn×m)|x=y=1=4mn+8n
  • Second Zagreb Index M2(f(n×m))

(Dx.Dy)(fn×m)|x=y=1=4mn+20n
  • Modified Second Zagreb Index "M2( f(n×m))

(Sx.Sy)(fn×m)|x=y=1=14mn716n
  • Generalized Randic Index Rα(f(n×m))

(Dxα.Dyα)(fn×m)|x=y=1=22αmn+(22α+2(α+1)3)22αn
  • Inverse Randic Index RRα(f(n×m))

(Sxα.Syα)(fn×m)|x=y=1=2(2α)mn+(2(α+1).4α2(2α).3+4(2α))n
  • Symmetric Division Index SSD(f(n×m))

(SyDx+SxDy)(fn×m)|x=y=1=2mn+n
  • Harmonic Index H (f(n×m))

2SxJ(fn×m)|x1=14mn724n
  • Inverse Index I(f(n×m))

SxJDxDy(fn×m)|x=1=mn+53n
  • Augmented Zagreb Index A( f(n×m))

Sx3Q(n2)JDx3Dy3f(x,y)|x=1=23mn+(2523.3+2.3(3).44)n
  • Measure of Irregularity

IRM(f(x,y))=8n
  • Reformulated Zagreb Index

M1[L(fn×m)]=8mn+72n+4m

2.2 Zagreb Coindices

For a graph G and its complement . we have,

F(G¯)=n(n1)36m(n1)2+3(n1)M1(G)F(G)F(fn×m¯)=n43n3+3n273n8mn+6mn26mF¯(G)=(n1)M1(G)F(G)F¯(fn×m)=8n256n12mn+4mn2F¯(G¯)=2m(n1)22(n1)M1(G)+F(G)F¯(fn×m¯)=24mn6mn2+64n+2m16n2

Communicated by Juan L.G. Guirao

References

  • [1]

    Rücker, G.; Rücker, C. On topological indices, boiling point, and cycloalkanes. J. Chem. Inf. Comput. Sci. 1999, 39, 788-802.

  • [2]

    Klavzar, S.; Gutman, I. A comparison of the Schultz molecular topological index with the Wiener index. J. Chem. Inf. Comput. Sci. 1996, 36, 1001-1003.

  • [3]

    Bückler, F.M.; Došlić, T.;Graovac,A.; Gutman, I. On the class of distance-based molecular structure descriptors.Chem. Phy. Lett. 2011, 503, 336-338.

  • [4]

    Deng, H.; Yang, J.; Xia, F. A general modeling of some vertex-degree based topological indices in benzenoid system and phenylenes. Comput. Math. Appl 2011, 61, 3017-3023

  • [5]

    Zhang, H.; Zhang, F. The Clar covering polynomial of hexagonal system I. Discret. Appl. Math 1996, 69, 147-167.

  • [6]

    Gutman, I. Some properties of the Winer polynomial. Graph Theory Notes N. Y 1993, 125, 13-18.

  • [7]

    Deutsch, E.; Klavzar, S. M-Polynomials, and degree based topolical indices. Iran. J. Math. chem 2015,6, 93-102.

  • [8]

    Munir, M.;Nazeer, W.;Rafique, S.; Kang, S.M. M-Polynomial and related topolical indices of Nanostar dendrimer. Symmetry 2016, 8, 97.

  • [9]

    Munir, M.;Nazeer, W.;Rafique, S.; Kang, S.M. M-Polynomial and Degree-Based topolical indices of Polyhex Nanotube. Symmetry 2016, 8, 179.

  • [10]

    Munir, M.;Nazeer, W.;Rafique, S.; Nizami. A.R.; kang, S.M. Some Computational Aspects of Triangular Boron Nanotube. Symmetry 2016, 9, 6.

  • [11]

    Munir, M.;Nazeer, W.;Shahzadi, Z.; kang,S.M. Some invariants of circular graphs. Symmetry 2016, 8, 134.

  • [12]

    Wiener,H.Structural determination of paraffin boiling. J. Am. Chem. Soc 1947, 69, 17-20.

  • [13]

    Dobrynin, A.A.; Entringer, R.’ Gutman, I. Winer index of trees: Theory and applications. Acta Appl. Math 2001, 66, 211-249.

  • [14]

    Gutman, I.; Polansky, O.E. Mathematics Concept in Organic Chemistry; Springer Science Business Media: New York, NY, USA, 2012.

  • [15]

    Randic, M. Characterization of molecular branching. J. Am. Chem. Soc. 1975,97, 6609-6615.

  • [16]

    Bollobȁs, B.; Erdős, P. Graphs of extremal weights. Ars Comb. 1998, 50, 225-233.

  • [17]

    Amic, D.; Bešlo, D.; Lucic, B.; Nikolic. S.; Trinajstic, N. The vertex-connectivity index revisited. J. Chem. Inf. Comput. Sci 1998, 38, 819-822.

  • [18]

    Hu, Y.; Li, X,; Shi, Y.; Xu, T.; Gutman, I. On molecular graphs with smallest and greatest zeroth-order general Randic index. MATCH Commun Math. Comput. chem 2005, 54, 425-434.

  • [19]

    Caporossi, G.; Gutman, I.; Hansen, P.; Pavlović, L. Graphs with maximum connectivity index. Comput. Biol. Chem. 2003, 27, 85-90.

  • [20]

    Kier, L.B.; Hall, L.H. Molecular Connectivity in Chemistry and Drug Research Academic Press: New Yourk, NY, USA, 1976.

  • [21]

    Ghorbani, M.; Azimi, N. Notes on mulyiple Zagreb indices. Iran. J. Math. chem. 2012, 3, 137-143.

  • [22]

    V. A. Ditkin, Operator calculus, Uspehi Mat. Nauk, T. II, Vip. 6 (22) (1947), 72-158 (in Russian).

[1]

Rücker, G.; Rücker, C. On topological indices, boiling point, and cycloalkanes. J. Chem. Inf. Comput. Sci. 1999, 39, 788-802.

[2]

Klavzar, S.; Gutman, I. A comparison of the Schultz molecular topological index with the Wiener index. J. Chem. Inf. Comput. Sci. 1996, 36, 1001-1003.

[3]

Bückler, F.M.; Došlić, T.;Graovac,A.; Gutman, I. On the class of distance-based molecular structure descriptors.Chem. Phy. Lett. 2011, 503, 336-338.

[4]

Deng, H.; Yang, J.; Xia, F. A general modeling of some vertex-degree based topological indices in benzenoid system and phenylenes. Comput. Math. Appl 2011, 61, 3017-3023

[5]

Zhang, H.; Zhang, F. The Clar covering polynomial of hexagonal system I. Discret. Appl. Math 1996, 69, 147-167.

[6]

Gutman, I. Some properties of the Winer polynomial. Graph Theory Notes N. Y 1993, 125, 13-18.

[7]

Deutsch, E.; Klavzar, S. M-Polynomials, and degree based topolical indices. Iran. J. Math. chem 2015,6, 93-102.

[8]

Munir, M.;Nazeer, W.;Rafique, S.; Kang, S.M. M-Polynomial and related topolical indices of Nanostar dendrimer. Symmetry 2016, 8, 97.

[9]

Munir, M.;Nazeer, W.;Rafique, S.; Kang, S.M. M-Polynomial and Degree-Based topolical indices of Polyhex Nanotube. Symmetry 2016, 8, 179.

[10]

Munir, M.;Nazeer, W.;Rafique, S.; Nizami. A.R.; kang, S.M. Some Computational Aspects of Triangular Boron Nanotube. Symmetry 2016, 9, 6.

[11]

Munir, M.;Nazeer, W.;Shahzadi, Z.; kang,S.M. Some invariants of circular graphs. Symmetry 2016, 8, 134.

[12]

Wiener,H.Structural determination of paraffin boiling. J. Am. Chem. Soc 1947, 69, 17-20.

[13]

Dobrynin, A.A.; Entringer, R.’ Gutman, I. Winer index of trees: Theory and applications. Acta Appl. Math 2001, 66, 211-249.

[14]

Gutman, I.; Polansky, O.E. Mathematics Concept in Organic Chemistry; Springer Science Business Media: New York, NY, USA, 2012.

[15]

Randic, M. Characterization of molecular branching. J. Am. Chem. Soc. 1975,97, 6609-6615.

[16]

Bollobȁs, B.; Erdős, P. Graphs of extremal weights. Ars Comb. 1998, 50, 225-233.

[17]

Amic, D.; Bešlo, D.; Lucic, B.; Nikolic. S.; Trinajstic, N. The vertex-connectivity index revisited. J. Chem. Inf. Comput. Sci 1998, 38, 819-822.

[18]

Hu, Y.; Li, X,; Shi, Y.; Xu, T.; Gutman, I. On molecular graphs with smallest and greatest zeroth-order general Randic index. MATCH Commun Math. Comput. chem 2005, 54, 425-434.

[19]

Caporossi, G.; Gutman, I.; Hansen, P.; Pavlović, L. Graphs with maximum connectivity index. Comput. Biol. Chem. 2003, 27, 85-90.

[20]

Kier, L.B.; Hall, L.H. Molecular Connectivity in Chemistry and Drug Research Academic Press: New Yourk, NY, USA, 1976.

[21]

Ghorbani, M.; Azimi, N. Notes on mulyiple Zagreb indices. Iran. J. Math. chem. 2012, 3, 137-143.

[22]

V. A. Ditkin, Operator calculus, Uspehi Mat. Nauk, T. II, Vip. 6 (22) (1947), 72-158 (in Russian).

Journal Information

Figures

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 61 61 44
PDF Downloads 23 23 16