Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Open Chemistry

formerly Central European Journal of Chemistry

IMPACT FACTOR 2018: 1.512
5-year IMPACT FACTOR: 1.599

CiteScore 2018: 1.58

SCImago Journal Rank (SJR) 2018: 0.345
Source Normalized Impact per Paper (SNIP) 2018: 0.684

ICV 2018: 163.25

Open Access
See all formats and pricing
More options …
Volume 17, Issue 1


Volume 13 (2015)

Computational Analysis of new Degree-based descriptors of oxide networks

Zafar Hussain / Mobeen Munir
  • Corresponding author
  • Department of Mathematics, Division of Science and Technology, University of Education, Lahore 54000, Lahore, Pakistan
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Muhammad Bilal / Alam Ameer
  • Department of Mathematics, Division of Science and Technology, University of Education, Lahore 54000, Lahore, Pakistan
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Shazia Rafique / Shin Min Kang
  • Corresponding author
  • Department of Mathematics and Research Institute of Natural Science, Gyeongsang National University, Jinju 52828, Korea, and Center for General Education, China Medical University, Taichung 40402, Taichung Taiwan
  • Email
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
Published Online: 2019-03-29 | DOI: https://doi.org/10.1515/chem-2019-0023


Oxide networks have diverse applications in the polymer and pharmaceutical industries. Polynomials and degree-based topological indices have tendencies to correlate properties of molecular graphs. In this article, we formulate the closed forms of Zagreb and forgotten polynomials and topological indices such as Hyper-Zagreb index, first and second multiple Zagreb indices, forgotten index, Albert index, Bell index, IRM(G) of oxide networks. We also compute the F-index of complement of oxide networks, F-coindex of G and F-coindex of complement of oxide networks. We put graphical analysis of each index with respect to the parameter involved in each case.

Keywords: Degree-based topological index; Oxide network; Forgotten Index; Co-index

AMS MSC: 05C07; 05C10

1 Introduction

Today has witnessed the abrupt developments in nano-materials and drugs, which keeps in running with the development of pharmacopedia. The physical and biological testing of new reagents is always a critical issue. In addition, theoretical calculations are performed to model the characteristics of new and proposed compounds to save time and costs. The goal of these calculations is to assist the choice of which compounds to synthesise in the laboratory. One such model which achieved extreme success in recent years, is the graph associated to the underlying compound or structure where every atom is described by a vertex and chemical bond by an edge. Let G be a graph corresponding to the chemical structure with vertex(atom) set V(G) and edge(bond) set E(G). The distance between two vertices u and v is described by d(u, v), is the shortest path between two vertices, similarly the diameter of any graph is the longest distance between any two vertices. The degree of a vertex (V) is the number of vertices connected to v by edges. The number of vertices in a graph represents its order and the number of edges represents its size. Chemical graph theory, as a branch of mathematical chemistry, attempts to correlate properties of molecular structures using the tools of mathematics like matrices, polynomials, functions and operators. The concept of valence in chemistry is a similar concept to degree of a vertex in graph theory. Graph theory is the branch of mathematics in which the structure of graphs and networks is studied. Graph theory plays a vital role in mathematical chemistry, molecular topology and computational nano-materials [1, 4, 10]. It produces a graph theoretic model of the chemical substance which becomes an entity to be discussed combinatorially and mathematically. Results obtained are checked practically so that properties of the substance under discussion are foreseen.

Chemical graph theory plays substantial role in determining structures and patterns of molecular graphs and networks. With every passing day, new relations between these subjects continue to emerge on the scene. Some basic tools used so far are topological indices and connectivity polynomials in this regard. Attempts are in progress to invent a general polynomial which can provide essential information after application of compositions of several differential and integral operators. Weiner introduced the concept of pass number to measure properties such as heats of formation, chromatographic retention time, boiling point and strain energy [1]. Hosoya introduced the Hosoya index in 1971 and used distance matrix to redefine the pass number (w) of Wiener [2]. Since Wiener’s definition was useful only for acyclic molecular graphs, it did not capture the attention of chemists, nevertheless Hosoya’s paper made it popular. Hosoya’s other substantial contribution appeared in 1988 to define w by proposing Wiener polynomial, which, is now known as Hosoya polynomial [3]. Distance based polynomials and functions are invariants of the structures and preserve the metric structure.

In the context of degree-based indices, a recent good addition is the M-polynomial that plays exactly the same role in parallel to the Hosoya polynomial for distance-based indices [5]. In [6, 7, 8, 9, 11, 12], several authors used the M-polynomial and related topological indices of different structures involving nanostar dendrimers, polyhex nanotubes, hex-derived networks, and some benzenoid systems. In fact the M-polynomial and other related polynomials like Zagreb and Forgotten polynomials are studied relatively more than other polynomials. Topological index preserves the topological symmetries of the structure and are frequently used in quantitative structure-activity relationships (QSARs). Here these indices are used to predict toxicity and determine regularity decisions, risk assessment, drug discovery and lead optimization [2, 4, 13, 14]. Researchers are actively working to discover new polynomials and topological indices and their actual correlations of these indices and properties of the chemical structures and nano-materials.

In the present work, we present new topological characterizations of oxide networks in the form of degree-based indices and polynomials. Moreoverwe also compute co-indices of these networks. We also determine the closed forms of some indices which determine the irregularity of oxide networks. For basic preliminaries and introductory literature review we refer [34, 35] and references therein.

2 Main Results

In this part we establish our new results about oxide networks, (OXn), n > 1. This network can be obtained by removing all silicon nodes from silicone network of dimension n, [15, 16]. Figure 1 is a schematic illustration of an oxide network of dimension 5.

Figure of (OX5)
Figure 1

Figure of (OX5)

We reserve the symbol (OXn), n > 1 for oxide network of dimension n. From figures (1-2) it is obvious that the order and size of (OXn) is respectively, 9n2+3n and 18n2. Another noticeable observation is the fact that (OXn), n > 1 has only vertices of degree 2 and 4. In this paper we compute first Zagreb polynomial, second Zagreb polynomial, Forgotten polynomial and some topological indices such as Hyper-Zagreb index, first and second multiple Zagreb indices, Forgotten index, Albert index, Bell index, IRM(G) and M1(L(G)). We also compute first and second Zagreb coindices, F-index of complement of (OXn), F-coindex of (OXn) and F-coindex of complement of oxide networks. We also give graphical analysis of each index and co-index with respect to the parameters involved in each class.

Graphs of Zagreb and Forgotten indices
Figure 2

Graphs of Zagreb and Forgotten indices

The following result gives the general form of Zagreb Polynomials and Forgotten polynomial of the oxide networks.

Theorem 2.1

Let (OXn), n > 1 be oxide network. Then first Zagreb polynomial,second Zagreb polynomial and Forgotten polynomial of (OXn) are

  1. M1(OXn; x) = 12nx6 + (18n2 − 12n)x8,

  2. M2(OXn; x) = 12nx8 + (18n2 − 12n)x16,

  3. F(OXn; x) = 12nx20 + (18n2 − 12n)x32.

Proof. Let (OXn), n > 1 is oxide network having order n = 9n2+3n and size m = 18n2. From figure12, we come to know that the oxide networks (OXn) has only vertices of degree 2 and 4. Let V1 and V2 represent vertices of degree 2 and 4 respectively, where |V1| = 6n and |V2| = 9n2 − 3n. The edge partitions of (OXn) are

E{2,4} = e = uvϵE(OXn)/du = 2, dv = 4 → |E{2,4}| = 12n,E{4,4} = e = uvϵE(OXn)/du = 4, dv = 4 → |E{4,4}| = 18n2 − 12n, where E{2,4} is the set of edges having end vertices of degree 2 and 4 and E{4,4} is the set of edges having end vertices of degree 4 and 4.

  1. By definition the first Zagreb polynomial, M1(OXn,x)=uvϵE(OXn)x[du+dv],=uvϵE1(OXn)x[du+dv]+uvϵE2(OXn)x[du+dv]=|E1(OXn)|x6+|E2(OXn)|x8=12nx6+(18n212n)x8.

  2. Now by definition the second Zagreb polynomial, M2(OXn,x)=uvϵE(OXn)x[du×dv],=uvϵE1(OXn)x[du×dv]+uvϵE2(OXn)x[du×dv],=|E1(OXn)|x8+|E2(OXn)|x16=12x8+(18n212n)x16,

  3. Now by definition the Forgotten polynomial, F(OXn;x)=uvϵE(OXn)x[du2+dv2],=uvϵE1(OXn)x[du2+dv2]+uvϵE2(OXn)x[du2+dv2],=|E1(OXn)|x20+|E2(OXn)|x32,=12nx20+(18n212n)x32.

Theorem 2.2

Let OXn , n > 1 is oxide networks. Then





Proof. a. By definition of hyper-Zagreb index


b. By the definition of first Zagreb index,


c. By definition of second multiple Zagreb index,


d. By definition of Forgotten index,


= 20|E1(OXn)| + 32|E2(OXn)|,

= 576n2 − 144n.

Theorem 2.3

Let (OXn), n > 1 is oxide network, then

  1. a. Albertson index, A(OXn24n,

  2. b. Bell index,B(OXn))=24n(3n1)(3n+1),

  3. c. IRM(OXn) = 48n,

  4. d.M1(L(OXn)) = 24n(27n − 10).

Proof. a. Albertson index


b. Bell Index


c. IRM(G)


d. M1(L(G))


Theorem 2.4

Let oxide network (OXn), n > 1 then,

  1. a. M1(G) = 12n(27n3 − 3n2 − 3n + 2),

  2. b. M2(G) = 26n(18n3 − 10n + 3).

Proof. Let oxide network (OXn), n > 1 having order n = 9n2+3n and size m = 18n2, the first Zegreb index M1(OXn) of (OXn) is 144n2 − 24n and the second Zagreb index M2(OXn) of oxide network is 288n2 − 96n then,



Theorem 2.5

Let oxide network (OXn), n > 1, then,

  1. a. F(OXn) = 3n(486n7+1782n6+81n5−2286n4+1485n3+459n2 − 438n + 71),

  2. b. F(OXn) = 24n(54n3 + 9n2 − 33n + 7),

  3. c. F(OXn) = 12n(54n5 + 162n4 −243n3−54n2+87n −12),

Proof. Let oxide network (OXn), n > 1 having order n = 9n2+3n and size m = 18n2, the first zegreb index M1(OXn) of (OXn) is 144n2 − 24n and the Forgoten index F(OXn) of oxide network is 576n2 − 144n, then

a. F(OXn)

F(G) = n(n − 1)3 − 6m(n − 1)2 + 3(n − 1)M1(G) − F(G),

F(OXn) = (9n2 + 3n)(9n2 + 3n − 1)3 − 6(18n2)(9n2 + 3n − 1)2 + 3(9n2 + 3n − 1)(144n2 − 24n) − (576n2 − 144n),

F(OXn) = 3n(486n7 + 1782n6 + 81n5 −2286n4 + 1485n3 + 459n2 − 438n + 71), b. F(OXn)

F(G) = (n − 1)M1(G) − F(G),

F(OXn) = (9n2 + 3n − 1)(144n2 − 24n) − (576n2 − 144n),

F(OXn) = 24n(54n3 + 9n2 − 33n + 7), c. F(OXn)

F(G) = 2m(n − 1)2 − 2(n − 1)M1(G) + F(G),

F(OXn) = 2(18n2)(9n2 + 3n−1)2 −2(9n2 + 3n −1)(144n2 − 24n) + (576n2 − 144n),

F(OXn) = 12n(54n5+162n4−243n3−54n2+87n−12).

3 Computational Analysis and Description

In this part we give computational analysis of computed indices of oxide networks. Figure 2 gives dependence of M1,M2 and F on the involved parameter n. Clearly, Forgotten index increases sharply as compared to M1, and M2. However these three indices increase with increase in n. It is now an established fact that total π-electron energy is related with Forgotten index [4, 10], so it can be concluded that this energy will rise with the rise in n. Figure 3 suggests that Bell, Alberton and IRM are linearly related with n. However Bell index is the slowest in these indices. All these three indices actually measure the tendency of structure to be irregular. These graphs show that the oxide network becomes more irregular and complex as n increases. Figure 4 suggests that first Zagreb index of the line graph of oxide networks is linearly related with n. The graph in Figure 5 shows the dependence of HM( OXn) on n. It is clear that this index is more sensitive than the above described indices for large range of n. It is evident from Figure 6 that PM1(OXn) remains negligible for n ≤ 4. After n > 5 it rises without bounds. It is evident from Figure 7 that PM2(OXn) remains negligible for n ≤ 3. After n > 4 it rises without bounds. The shape of the graph of F (OXn) is a parabola, showing that it increases rapidly with an increase in n, Figure 8.

Graphs of Albertson, Bell, and IRM indices
Figure 3

Graphs of Albertson, Bell, and IRM indices

Graph of first Zagreb index of line graph
Figure 4

Graph of first Zagreb index of line graph

Graph of HM(OXn)
Figure 5

Graph of HM(OXn)

Graph of PM1(OXn)
Figure 6

Graph of PM1(OXn)

Graph of PM2(OXn)
Figure 7

Graph of PM2(OXn)

Graph of F(OXn)
Figure 8

Graph of F(OXn)

4 Conclusions

M-polynomial and other related polynomials such as Zagreb and Forgotten polynomials have recently been studied in a high frequency. In [34], the authors computed degree-based indices of alpha boron nanotubes and compared the behaviour of these indices on two types of boron nanotubes. In [35],Hussain et al. formulated degree-based indices and co-indices of honey-comb networks. The present article provides computation of several indices and co-indices of oxide networks. In particular, we computed Forgotten and Zagreb polynomials of general oxide networks. We also provided index analysis of oxide networks and dependence of these indices in the form of graphs using Mapple. These indices are actually correlated with chemical properties of oxide networks and will be useful for people practically working in chemical industry.


  • [1]

    Wiener, H. J, Structural determination of paraffin boiling points Journal of the American Chemical Society, vol. 69, no. 1, pp. 17-20, 1947. CrossrefPubMedGoogle Scholar

  • [2]

    Hosoya, H., Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated Hydrocarbons Bulletin of the Chemical Society of Japan, 44, 9, 1971, 2332-2339. CrossrefGoogle Scholar

  • [3]

    Hosoya, H., On some counting polynomials in Chemistry Disc. Appli. Math, 19, 1988, pp. 239-257. CrossrefGoogle Scholar

  • [4]

    Gutman, I.; Trinajstic, N, Graph theory, and molecular orbitals total f-electron energy of alternant hydrocarbons Chem. Phys. Lett. 1972, 17, 535-538. CrossrefGoogle Scholar

  • [5]

    Klavzar, S.; Deutsch, E. M-Polynomial, and Degree-Based Topological Indices Iranian J. Math. Chem, 2015, 6(2),93-102. Google Scholar

  • [6]

    Munir, M., Nazeer, W., Rafique, S., And Kang, S. M., M-polynomial and degree-based topological indices of Nano star dendrimers Symmetry 2016, 8, 97. doi:10.3390/sym8090097. CrossrefGoogle Scholar

  • [7]

    Munir, M., Nazeer, W., Rafique, S., Nizami, A. R., And Kang, S. M., M-polynomial and degree-based topological indices of Titania Nanotubes Symmetry 2016, 8, 117; doi:10.3390/sym8110117. Google Scholar

  • [8]

    Munir, M., Nazeer, W., Rafique, S., And Kang, S. M., M-Polynomial and Degree-Based Topological Indices of Polyhex Nanotubes Symmetry. 8(12), 149; 10.3390/sym8120149 (2016). CrossrefWeb of ScienceGoogle Scholar

  • [9]

    Kwun, Y. C., Munir, M., Nazeer, W., Rafique, S., and Kang, S. M., M-Polynomials and topological indices of V-Phenylenic Nanotubes and Nanotori Scitific Reports | 7: 8756 | Doi:10.1038/s41598-017-08309-y. Google Scholar

  • [10]

    Rucker, G. , Rucker, C.,, On topological indices, boiling points, and cycloalkanes J. Chem. Inf. Comput. Sci. (1999) 39, 788. CrossrefGoogle Scholar

  • [11]

    Kang, S. M, Nazeer, W.; Manzoor, Z.; Nizami A. R., Aslam, A., and Munir, M., M-polynomials and topological indices of hex-derived networks, Open Physics. 2018, 16 394-403. CrossrefWeb of ScienceGoogle Scholar

  • [12]

    Ashaq, A., Nazeer, W., Munir, M., Kang, S. M., M-Polynomials And Topological Indices Of Zigzag And Rhombic Benzenoid Systems, Open Chemistry 2018, 16 73-78. CrossrefWeb of ScienceGoogle Scholar

  • [13]

    Gutman, I..Molecular graphs with minimal and maximal Randic indices. Croatica Chem. Acta (2002)75, 357-369. Google Scholar

  • [14]

    Gutman, I.. Degree-based topological indices. Croat. Chem. Acta (2013)86, 351-361. Web of ScienceCrossrefGoogle Scholar

  • [15]

    Akhter, S., Imran, M., Gao, W., Farahani, R., On topological indices of honeycomb networks and graphene networks Hac. Jour. Math. Stat. 2018, 47 19-35. Google Scholar

  • [16]

    Rajan, B., William, A., Grigorious, C., Stephen, S., On Certain Topological Indices of Silicate, Honeycomb and Hexagonal Networks J. Comp. Math. Sci. 2012, 3 530-535. Google Scholar

  • [17]

    Tabar. F., Gutman, I., Nasiri, R. , Extremely irregular trees Bull. Cl. Sci. Math. Nat.Sci.Math. 145 (2013), 1-8.Google Scholar

  • [18]

    Furtula, B., Gutman, I.,, A forgotten topological index J. Math. Chem. 53 (2015), 1184-1190.CrossrefGoogle Scholar

  • [19]

    Shirdel, G. H, Pour, H. R, Sayadi, A. M., The hyper-Zagreb index of graph operations Iran. J. Math. Chem. 4(2) 2013, 213-220.Google Scholar

  • [20]

    Ghorbani, A., Azimi, N.,, Note on multiple Zagreb indices Iran. J. Math. Chem. 3 (2), (2012) 137-143.Google Scholar

  • [21]

    Albertson, M., The irregularity of a graph Ars. Combin. 46, (1997), 219-225.Google Scholar

  • [22]

    Bell, F., A note on the irregularity of graphs Linear Algebra Appl. 161, (1992), 45-54.CrossrefGoogle Scholar

  • [23]

    Milicevic, A., Nikolic, S., Trinajstic, N., On reformulated Zagreb indices Mol. Diversity. 8, (2004), 393-399.CrossrefGoogle Scholar

  • [24]

    Doslic, T.,Vertex-weighted Wiener polynomials for composite graphs Ars. Math. Contemp. 1, (2008), 66-80.Web of ScienceCrossrefGoogle Scholar

  • [25]

    Gutman, I., Furtula, B., Vukicevic, Z., Popivoda, G.,, (2015) ON AN Old / New Degree-Based Topological Index Bull. Acad. Serbe Sci. Arts (Cl. Sci. Math. Natur.). 2015, 19-31.

  • [26]

    Hao, J., Theorems about Zagreb Indices and Modified Zagreb Indices. Match Commun. Math. Comput. Chem. 2011, 65, 659-670.Google Scholar

  • [27]

    Bruckler, F. M., Doslic, T., Graovac, A., Gutman, I. (2011) On a class of distance-based molecular structure descriptors Chem. Phys. Lett. 503, 336-338.CrossrefWeb of ScienceGoogle Scholar

  • [28]

    Deng, H., Yang, J., Xia, F., A general modeling of some vertex-degree based topological indices in benzenoid systems and phenylenes Comp. Math. Appl. (2011) 61, 3017-3023.CrossrefGoogle Scholar

  • [29]

    Huang, Y., Liu, B., Gan, L.,, Augmented Zagreb Index of Connected Graphs Match Commun. Math. Comput. Chem. 67 (2012) 483-494Google Scholar

  • [30]

    Kier, L. B., Hall, L. H.,, Molecular Connectivity in Structure-Activity Analysis (Wiley, New York, 1986).Google Scholar

  • [31]

    Gutman, I., Furtula, B., Vukicevic, Z., Popivoda, G., On Zagreb indices and coindices Match Commun. Math. Comput. Chem, 74(1), 5-1,(2015).Google Scholar

  • [32]

    Bieri, G., Dill, J. D., Heilbronner, E., Schmelzer, A., Application of the Equivalent Bond Orbital Model to the C2s-Ionization Energies of Saturated Hydrocarbons Helv. Chim. Acta 1977, 60, 2234-2247.CrossrefGoogle Scholar

  • [33]

    Heilbronner, E., A Simple Equivalent Bond Orbital Model for the Rationalization of the C2s-Photoelectron Spectra of the Higher n-Alkanes, in Particular of Polyethylene Helv. Chim. Acta 1977, 60, 2248-2257.CrossrefGoogle Scholar

  • [34]

    Kwun, Y.C., Munir, M., Nazeer, W., Rafique, S., Kang, S.M, Computational Analysis of topological indices of two Boron Nanotubes 8, 1, 2018. Google Scholar

  • [35]

    Hussain, Z., Munir, M., Rafique, S. Kang, S. M., Topological Characterizations and Index-Analysis of New Degree-Based Descriptors of Honeycomb Networks Symmetry 2018, 10, 478. CrossrefWeb of ScienceGoogle Scholar

About the article

Received: 2018-04-14

Accepted: 2018-11-17

Published Online: 2019-03-29

Citation Information: Open Chemistry, Volume 17, Issue 1, Pages 177–182, ISSN (Online) 2391-5420, DOI: https://doi.org/10.1515/chem-2019-0023.

Export Citation

© 2019 Z. Hussain et al., published by De Gruyter. This work is licensed under the Creative Commons Attribution 4.0 Public License. BY 4.0

Comments (0)

Please log in or register to comment.
Log in