2,609
Views
53
CrossRef citations to date
0
Altmetric
Articles

Beyond the Zagreb indices

, &

Abstract

The two Zagreb indices M1=vd(v)2 and M2=uvd(u)d(v) are vertex-degree-based graph invariants that have been introduced in the 1970s and extensively studied ever since. In the last few years, a variety of modifications of M1 and M2 were put forward. The present survey of these modified Zagreb indices outlines their main mathematical properties, and provides an exhaustive bibliography.

1 Introduction

In this paper we are concerned with simple graphs, that is graphs without multiple, directed, or weighted edges, and without self-loops. Let G be such a graph with vertex set V(G) and edge set E(G). Let |V(G)|=n and |E(G)|=m.

If two vertices u and v of the graph G are adjacent, then the edge connecting them will be denoted by uv.

The number of first neighbors of the vertex uV(G) is its degree, and will be denoted by d(u).

The first and second Zagreb indices are vertex-degree-based graph invariants defined as (1) M1=M1(G)=uV(G)d(u)2(1) and (2) M2=M2(G)=uvE(G)d(u)d(v).(2) The quantity M1 was first time considered in 1972 [Citation1], whereas M2 in 1975 [Citation2]. These were named Zagreb group indices [Citation3] (in view of the fact that the authors of [Citation1,2] were members of the “Rudjer Bošković” Institute in Zagreb, Croatia). Eventually, the name was shortened into first Zagreb index and second Zagreb index [Citation4].

An alternative expression for the first Zagreb index is [Citation5] (3) M1=uvE(G)[d(u)+d(v)],(3) which happens to be a special case of a more general identity [Citation6] uV(G)γ(d(u))=uvE(G)γ(d(u))d(u)+γ(d(v))d(v)which is valid for any function γ(x), defined for x=d(u),uV(G).

Let d(uv) be the degree of the edge uv, equal to the number of edges that are incident to uv. It is immediate that d(uv)=d(u)+d(v)2, and thus by Eq. (3), uvE(G)d(uv)=M1(G)2mi.e., (4) M1=uvE(G)[d(uv)+2].(4) Accordingly, the first Zagreb index can be considered as edge-degree-based topological index as well.

The two Zagreb indices attracted much interest and a plethora of their mathematical properties and chemical applications were reported. As an illustration of how extensive these studies have been, and still are, we mention that the articles [Citation1] and [Citation2] are quoted in (at least) 54 and 70 books, which means well over 1000 times in published papers.

Details of the theory and applications of the two Zagreb indices can be found in several surveys [Citation7–13] and in the references quoted therein.

After most of the results on Zagreb indices were established, the inevitable occurred: Their various modifications have been proposed, thus opening the possibility to do analogous research and publish numerous additional papers. In what follows, we outline the main directions of scholarly activities along these lines.

2 General Zagreb indices

The most direct and most straightforward modification of the Zagreb-index-conceptis to introduce in their definition a variable parameter: M1(α)=uV(G)d(u)α=uvE(G)[d(u)α1+d(v)α1]and M2(α)=uvE(G)[d(u)d(v)]α,where α is a real number. These generalizations of the Zagreb indices seem to be first considered by Li et al. [14,15], and then followed by countless other publications. M1(α) and M2(α) are called general Zagreb indices (see e.g., [16–19]) or variable Zagreb indices (see e.g., [20–23]). In addition, M1(α) is also studied under the name zeroth-order general Randić index (see e.g., [24–26]), whereas M2(α) under the name general Randić index (see e.g., [27–29]).

Based on (3) and (4), in [30] the following generalization of the first Zagreb index was introduced Hα=Hα(G)=uvE(g)[d(u)+d(v)]α=uvE(G)[d(uv)+2]α,αRunder the name general sum-connectivity index.

Let Δ=maxuV(G)d(u), δ=minuV(G)d(u), Δe1=maxuvE(G)d(uv)+2 and δe1=minuvE(G)d(uv)+2. Then the following inequalities for M1(α) and Hα are valid (see for example [31–33]) M1(α+1)(Δ+δ)M1(α)+ΔδM1(α1)0,Hα+1(Δe1+δe1)Hα+Δe1δe1Hα10,M1(α+1)M1α(2m)α1,α0 or α1,Hα+1(F+2M2)αM1α1,α0 or α1,where F is the forgotten index defined as F=uV(G)d(u)3.

When 0α1, the sense of the last two inequalities reverses. These inequalities are general and by the appropriate choice of parameter α upper and lower bounds for a number of Zagreb type topological indices can be obtained.

It happens occasionally, that author(s) propose a new topological index and that it turns out to be already defined under a different name. Thus, for example, in [34] the authors defined a new index, named general harmonic index, Hα, as Hα=Hα(G)=uvE(G)2d(u)+d(v)α.However, since Hα=2αHαthis obviously is not a new topological index.

Similarly, in [35] a so called Re-defined version of Zagreb indices, ReZG1, ReZG2,and ReZG3, were introduced and defined as ReZG1=ReZG1(G)=uvE(G)d(u)+d(v)d(u)d(v),ReZG2=ReZG2(G)=uvE(G)d(u)d(v)d(u)+d(v),ReZG3=ReZG3(G)=uvE(G)[d(u)d(v)][d(u)+d(v)].However, since ReZG1=n, it is not a topological index at all. On the other hand, ReZG2=ISI, where ISI=ISI(G), is the inverse sum indeg index, earlier defined in [36]. The index ReZG3 was named re-defined third Zagreb index. A few years later the same index was proposed in [37] under the name second Gourava index, obtained as a special case of the generalized Zagreb index Mr,s introduced in [38]: Mr,s=Mr,s(G)=uvE(G)[d(u)rd(v)s+d(v)rd(u)s].

Maybe the following generalization of Zagreb indices would also make sense: Mα,β=Mα,β(G)=uvE(G)[d(u)d(v)]α[d(u)+d(v)]β,where α and β are arbitrary real numbers. It can be easily observed that M0,1=M1, M1,0=M2, Mα,0=M2α and M0,β=Hβ.

2.1 Special cases

If α=2, then the general first Zagreb index M1(α) coincide with its ordinary version. The same happens with M2(α) if α=1. Some other special cases deserved particular interest and have been examined separately.

M1(α) for α=2 is the modified first Zagreb index, mM1, mM1=mM1(G)=uV(G)1d(u)2.It was first defined in [39].

M1(α) for α=1 is the inverse degree, ID, ID=ID(G)=uV(G)1d(u).This index is also known under names modified total adjacency index and sum of reciprocals of degrees. It has first attracted attention through a conjecture-generating computer program Graffiti [40,41]. The name inverse degree was first introduced in 2005 [42], followed by half-a-dozen papers [43–49].

M1(α) for α=12 is the zeroth-order Randić index, M1(12)=M1(12)(G)=uV(G)1d(u),a quantity conceived already in 1976 [50], but which was examined only in a relatively small number of subsequent papers (see e.g., [51–53]). Most results on M1(12) are found in studies concerned with the zeroth-order general Randić index (see e.g., [24–26]).

M1(α) for α=3 can be found already in the paper [Citation1], but neither in the 1970s nor in next 40 years did it attract any attention. Only in 2015, some of its unusual features (in quantitative structure–property chemical applications) have been recognized [54], after which this structure-descriptor suddenly became attractive to mathematical chemists [55–68]. This graph invariant was named forgotten topological index or F-index. Thus, (5) F=F(G)=uV(G)d(u)3=uvE(G)[d(u)2+d(v)2].(5)

M2(α) for α=12 is the classical Randić (or connectivity) index, R=R(G)=uvE(G)1d(u)d(v),put forward by Randić in 1975 [69]. It is probably the most popular and most thoroughly investigated molecular-structure descriptor. Details of its mathematical theory and physico-chemical usages go beyond the ambit of the present survey; these can be found in the books [50,70–73].

M2(α) for α=1 was first time examined in 1998 by Bollobás and Erdős [74,75], and is nowadays usually referred to as the Randić index R1 (see e.g., [76–79]) R1=R1(G)=uvE(G)1d(u)d(v).It is also known under the name modified second Zagreb index [80] and first order overall index [81] .

M2(α) for α=12 is the reciprocal Randić index, RR=RR(G)=uvE(G)d(u)d(v),introduced in [71,72].

Hα for α=12 is the sum-connectivity index, χ, χ=χ(G)=uvE(G)1d(u)+d(v)=uvE(G)1d(uv)+2,introduced in [82]. More on this index can be found in [83–85].

For α=1 we have that 2H1=H, where H=H(G)=uvE(G)2d(u)+d(v),is the harmonic index proposed in [40]. Details on its mathematical theory and applications can be found in [31,86].

Hα for α=2 becomes the hyper-Zagreb index HM(G)=uvE(G)[d(u)+d(v)]2=uvE(G)[d(u)+d(v)]2,introduced by Shirdel et al. in 2013 [87].

Although it is elementary to show that HM(G)=F(G)+2M2(G)the properties of the hyper-Zagreb index were nevertheless investigated in a few recent papers [88–95]. Emphasis was on bounds for HM, its coindices, and on its change under graph operations.

3 Sigma index

In order to provide a quantitative measure of graph irregularity, i.e., of the deviation of a graph from being regular, Albertson introduced the irregularity index [96] Alb(G)=uvE(G)|d(u)d(v)|.This index was also considered in [97] under the name third Zagreb index.

In order to avoid the absolute value in the above formula, in a recent paper [98], the sigma index was put forward, defined as σ(G)=uvE(G)[d(u)d(v)]2.The following identity is immediate: σ(G)=F(G)2M2(G).

The properties of σ are analogous to that of the Albertson index. Yet, there exist pairs of graphs G1,G2, such that Alb(G1)>Alb(G2) whereas σ(G1)<σ(G2) [99].

It can be shown that the following interplay between Alb(G) and σ(G) holds: Alb(G)mσ(G).

4 Reformulated Zagreb indices

In 2004, Miličević et al. [Citation100] proposed variants of the Zagreb indices using edge degrees instead of vertex degrees. Let, as before, d(uv) be the degree of the edge uv.

The so-called reformulated Zagreb indices are then defined in analogy to Eqs. (1) and (2) as [Citation100] RM1(G)=uvE(G)d(uv)2andRM2(G)=e,eE(G)d(e)d(e)where e,e are pairs of incident edges of the graph G.

It is trivially evident that the reformulated Zagreb indices of the graph G coincide with the ordinary Zagreb indices of the line graph of the graph G, and thus are nothing new. In spite of this, quite a few papers [101–110] have been devoted to the study of the indices RM1 and RM2, often “forgetting” to observe their close relation with the ordinary Zagreb indices.

A less trivial result along these lines is the identity [Citation101] RM1(G)=F(G)+2M2(G)4M1(G)+4m.

In a recent paper [Citation111], the concept of reformulated F-index was introduced: RF=RF(G)=uvE(G)d(uv)3.In [68] it was proved that RF=uvE(G)(d(uv)+2)36(F+2M2)+12M18m,which was exploited in [68,112] to determine lower bounds for RF.

5 Banhatti indices

In 2016, the Indian scholar Kulli put forward the following combination of ordinary and reformulated Zagreb indices [113,114]: B1(G)=u,e[d(u)+d(e)]andB2(G)=u,ed(u)d(e)where the summations go over pairs of a vertex u and edge e, such that e is incident to u. The author of [113,114] proposed that the new graph invariants be named K Banhatti indices, with Banhatti being a city in India whereas K might hint towards “Kulli”.

Unfortunately, the two Banhatti indices satisfy the identities [Citation115]: B1(G)=3M1(G)4mandB2(G)=HM(G)2M1(G)which reduce them to earlier known Zagreb-type indices.

Kulli proposed also hyper-K Banhatti indices, defined as [Citation116] HB1(G)=u,e[d(u)+d(e)]2andHB2(G)=u,e[d(u)d(e)]2whose properties await to be elaborated in the future.

6 Coindices and non-neighbor Zagreb indices

Let J(G) be any vertex-degree-based graph invariant of the form J(G)=uvE(G)Γ[d(u),d(v)]such that Γ(x,y)=Γ(y,x). Then the coindex of J(G) is defined as J¯(G)=uvuvE(G)Γ[d(u),d(v)] or, what is the same, as J¯(G)=uvE(G¯)Γ[d(u),d(v)]where G¯ is the complement of the graph G.

The concept of coindices was invented by Došlić in 2008 [Citation117] and was first applied to the two Zagreb indices. Thus, M¯1(G)=uvuvE(G)[d(u)+d(v)]andM¯2(G)=uvuvE(G)d(u)d(v).

By direct calculation it can be shown that the Zagreb coindices are in a simple relation with the Zagreb indices, viz., (6) M¯1(G)=2m(n1)M1(G),M¯2(G)=2m212M1(G)M2(G),M¯1(G¯)=2m(n1)M1(G),(6) (7) M¯2(G¯)=m(n1)2(n1)M1(G)+M2(G).(7)

In spite of this, in the recent literature [118–132] much work has been devoted to Zagreb coindices. For a review see [11].

Coindices of other Zagreb-type indices could also be determined. For instance [88]: HM¯(G)=4m2+(m2)M1(G)HM(G).

Rizwana et al. [Citation133] considered the non-neighbor Zagreb indices, based on the number of non-neighbors of a vertex, denoted by d¯(u). Evidently, for a graph of order n, d¯(u)=n1d(u). Therefore, if the non-neighbor Zagreb indices are defined as [Citation133] M1nn(G)=uV(G)d¯(u)2andM2nn(G)=uvE(G)d¯(u)d¯(v) then M1nn(G)=2m(n1)M1(G) and M2nn(G)=m(n1)2(n1)M1(G)+M2(G).

However, according to (6) and (7) it is obvious that M1nn(G)=M¯1(G¯)and M2nn=M¯2(G¯), so M1nn and M2nn cannot be considered as new topological indices.

7 Reduced Zagreb indices

From Eqs. (2) and (3) it immediately follows that M2(G)M1(G)=uvE(G)[d(u)1][d(v)1]m.From the analysis in the paper [Citation134] it appeared to be purposeful to consider the quantity RM2=RM2(G)=uvE(G)[d(u)1][d(v)1] as the reduced second Zagreb index. It can be easily observed that (see [Citation135]) RM2(G)=M2(G)M1(G)+m.Further studies along these lines can be found in [135–138].

A reduced reciprocal Randić index was defined in [Citation135] as RRR=RRR(G)=uvE(G)(d(u)1)(d(v)1)The authors of [Citation135] proved that for any connected graph with n vertices, the following inequalities are valid: RR(Pn)RR(G)RR(Kn),RM2(Sn)RM2(G)RM2(Kn),RRR(Sn)RRR(G)RRR(Kn),where Pn is a path, Sn a star graph, and Kn a complete graph.

It should be noted that the idea of “reduction”, i.e., replacement d(u)d(u)1, can be extended to any vertex-degree-based graph invariant [Citation135].

8 Leap Zagreb indices

In a recent paper [Citation139], Naji et al. elaborated the idea of using the second degree of a vertex, d2(u), namely the number of second neighbors. This leads to three leap Zagreb indices, defined as LM1(G)=uV(G)d2(u)2,LM2(G)=uvE(G)d2(u)d2(v),LM3(G)=uV(G)d(u)d2(u).It is interesting that as early as in 2008, Yamaguchi discovered an equality [Citation140] LM3(G)=M2(G)12M1(G)that holds for triangle- and quadrangle-free graphs.

In [Citation139] the bounds LM1(G)M1(G)+n(n1)24m(n1),LM2(G)M2(G)(n1)M1(G)+m(n1)2,LM3(G)2m(n1)M1(G)were established. Equality holds if and only if diam(G)2.

9 What is missing?

There are other directions in which Zagreb indices have been modified. These violate too much from the original concept, and have been left out from the present survey. Yet, we mention the main ideas.

Instead of summation, multiplication can be used in Eqs. (1)–(3) and elsewhere, resulting in multiplicative Zagreb indices. In particular, the multiplicative version of Eq. (1) is vV(G)d(v)2=vV(G)d(v)2[NK(G)]2which is just the square of the Narumi–Katayama index NK, put forward already in the 1980s [Citation141].

Bearing in mind Eq. (3), we may define the first Zagreb matrix Z(1) as (Z(1))ij=d(vi)+d(vj)if vivjE(G)0otherwise.If the eigenvalues of Z(1) are ζi(1),i=1,2,,n, then the first Zagreb energy would be [Citation142] ZE1(G)=i=1n|ζi(1)|.

Analogously, in view of Eq. (2), the second Zagreb energy could be defined as ZE2(G)=i=1n|ζi(2)|where ζi(2),i=1,2,,n, are the eigenvalues of the second Zagreb matrix Z(2), whose elements are (Z(2))ij=d(vi)d(vj)if vivjE(G)0otherwise.

References

  • GutmanI., TrinajstićN., Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons, Chem. Phys. Lett., 17 1972 535–538
  • GutmanI., RuščićB., TrinajstićN., WilcoxC.F., Graph theory and molecular orbitals. XII. Acyclic polyenes, J. Chem. Phys., 62 1975 3399–3405
  • BalabanA.T., MotocI., BonchevD., MekenyanO., Topological indices for structure–activity correlations, Topics Curr. Chem., 114 1983 21–55
  • GutmanI., On the origin of two degree–based topological indices, Bull. Acad. Serbe Sci. Arts Cl. Sci. Math. Natur., 146 2014 39–52
  • DošlićT., FurtulaB., GraovacA., GutmanI., MoradiS., YarahmadiZ., On vertex–degree–based molecular structure descriptors, MATCH Commun. Math. Comput. Chem., 66 2011 613–626
  • DošlićT., RétiT., VukičevićD., On the vertex degree indices of connected graphs, Chem. Phys. Lett., 512 2011 283–286
  • NikolićS., KovačevićG., MiličevićA., TrinajstićN., The Zagreb indices 30 years after, Croat. Chem. Acta, 76 2003 113–124
  • GutmanI., DasK.C., The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem., 50 2004 83–92
  • DasK.C., GutmanI., Some properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem., 52 2004 103–112
  • StevanovićD., Mathematical Properties of Zagreb Indices 2014Akademska misao Beograd (in Serbian)
  • GutmanI., FurtulaB., Kovijanić VukićevićŽ., PopivodaG., On Zagreb indices and coindices, MATCH Commun. Math. Comput. Chem., 74 2015 5–16
  • BorovićaninB., DasK.C., FurtulaB., GutmanI., Bounds for Zagreb indices, MATCH Commun. Math. Comput. Chem., 78 2017 17–100
  • BorovićaninB., DasK.C., FurtulaB., GutmanI., Zagreb indices: Bounds and extremal graphs GutmanI., FurtulaB., DasK.C., MilovanovićE., MilovanovićI.Bounds in Chemical Graph Theory –Basics2017Univ. Kragujevac Kragujevac 67–153
  • LiX., ZhaoH., Trees with the first three smallest and largest generalized topological indices, MATCH Commun. Math. Comput. Chem., 50 2004 57–62
  • LiX., ZhengJ., A unified approach to the extremal trees for different indices, MATCH Commun. Math. Comput. Chem., 54 2005 195–208
  • Britto Antony XavierG., SureshE., GutmanI., Counting relations for general Zagreb indices, Kragujevac J. Math., 38 2014 95–103
  • GutmanI., An exceptional property of the first Zagreb index, MATCH Commun. Math. Comput. Chem., 72 2014 733–740
  • LiuM., LiuB., Some properties of the first general Zagreb index, Australas. J. Combin., 47 2010 285–294
  • TongY.M., LiuJ.B., JiangZ.Z., LvN.N., Extreme values of the first general Zagreb index in tricyclic graphs, J. Hefei Univ. Nat. Sci., 1 2010 4–7
  • MoradianK., KazemiR., BehzadiM.H., On the first variable Zagreb index, Iran. J. Math. Chem., 8 2017 275–283
  • BogoevS., A proof of an inequality related to variable Zagreb indices for simple connected graphs, MATCH Commun. Math. Comput. Chem., 66 2011 647–668
  • HuangY., LiuB., ZhangM., On comparing the variable Zagreb indices, MATCH Commun. Math. Comput. Chem., 63 2010 453–460
  • LiuB., ZhangM., HuangY., Comparing variable Zagreb indices of graphs, MATCH Commun. Math. Comput. Chem., 65 2011 671–684
  • SuG., TuJ., DasK.C., Graphs with fixed number of pendent vertices and minimal zeroth–order general Randić index, Appl. Math. Comput., 270 2015 705–710
  • SuG., XiongL., SuX., LiG., Maximally edge-connected graphs and zeroth-order general Randić index for α≤−1, J. Comb. Optim., 31 2016 182–195
  • VolkmannL., Sufficient conditions on the zeroth-order general Randić index for maximally edge–connected digraphs, Commun. Comb. Optim., 1 2016 1–13
  • AnM., XiongL., Extremal polyomino chains with respect to general Randić index, J. Comb. Optim., 31 2016 635–647
  • ShiY., Note on two generalizations of the Randić index, Appl. Math. Comput., 265 2015 1019–1025
  • KnorM., LužarB., ŠkrekovskiR., Sandwiching the (generalized) Randić index, Discrete Appl. Math., 181 2015 160–166
  • ZhouB., TrinajstićN., On general sum-connectivity index, J. Math. Chem., 47 2009 1252–1270
  • MatejićM.M., MilovanovićI.Ž., MilovanovićE.I., On bounds of harmonic topological index, Filomat, 32 2018 311–317
  • MilovanovićI.Ž., ĆirićV.M., MilentijevićI.Z., MilovanovićE.I., On some spectral, vertex and edge degree–based graph invariants, MATCH Commun. Math. Comput. Chem., 72 2017 177–188
  • GutmanI., DasK.C., FurtulaB., MilovanovićE., MilovanovićI., Generalization of Szökefalvi Nagy and Chebyshev inequalities, with applications in spectral graph theory, Appl. Math. Comput., 313 2017 235–244
  • YanL., GaoW., LiJ.S., General harmonic index and general sum connectivity index of polyomino chains and nanotybes, J. Comput. Theor. Nanosci., 12 2015 3940–3944
  • RanjiniP.S., LokeshaV., UshaA., Relation between phenylene and hexagonal squeeze using harmonic index, Int. J. Graph Theory, 1 2013 116–121
  • VukičcevićD., GašparovM., Bond additive modeling 1. Adriatic indices, Croat. Chem. Acta, 83 2010 243–260
  • KuliV.R., The gourava indices and coindices of graphs, Ann. Pure Appl. Math., 14 2017 33–38
  • AzariM., IronmaneshA., Generalized Zagreb index of graphs, Studia Univ. Babes Bolyai, 56 2011 59–70
  • MilićevićA., NikolićS., On variable Zagreb indices, Croat. Chem. Acta, 77 2004 97–101
  • FajtlowiczS., On conjectures of Grafitti II, Congr. Numer., 60 1987 189–197
  • FajtlowiczS., On conjectures of Grafitti, Discrete Math., 72 1988 113–118
  • ZhangZ., ZhangJ., LuX., The relation of matching with inverse degree of a graph, Discrete Math., 301 2005 243–246
  • ChenX.G., FujitaS., On diameter and inverse degree of chemical graphs, Appl. Anal. Discrete Math., 7 2013 83–93
  • DankelmannP., HellwigA., VolkmannL., Inverse degree and edge–connectivity, Discrete Math., 309 2008 2943–2947
  • DankelmannP., SwartH.C., van den BergP., Diameter and inverse degree, Discrete Math., 308 2008 670–673
  • DasK.C., XuK., WangJ., On inverse degree and topological indices of graphs, Filomat, 30 2016 2111–2120
  • MukwembiS., On diameter and inverse degree of a graph, Discrete Math., 310 2010 940–946
  • XuK., DasK.C., Some extremal graphs with respect to inverse degree, Discrete Appl. Math., 203 2016 171–183
  • DasK.C., BalachandranS., GutmanI., Inverse degree, Randić index and harmonic index of graphs, Appl. Anal. Discrete Math., 11 2017 304–313
  • KierL.B., HallL.H., Molecular Connectivity in Chemistry and Drug Research 1976Academic Press New York
  • DasK.C., DehmerM., Comparison between the zeroth–order Randić index and the sum–connectivity index, Appl. Math. Comput., 274 2016 585–589
  • LiJ., LiY., The asymptotic value of the zeroth–order Randić index and sum–connectivity index for trees, Appl. Math. Comput., 266 2015 1027–1030
  • PavlovićL., LazićM., AleksićT., More on “Connected (n,m)-graphs with minimum and maximum zeroth–order Randić index”, Discrete Appl. Math., 157 2009 2938–2944
  • FurtulaB., GutmanI., A forgotten topological index, J. Math. Chem., 53 2015 1184–1190
  • AjmalM., NazeerW., KhalidW., KangS.M., Forgotten polynomial and forgotten index for the line graphs of banana tree graph, firecracker graph and subdivision graphs, Glob. J. Pure Appl. Math., 13 2017 2673–2682
  • DeN., F-index of bridge and chain graphs, Malay. J. Fund. Appl. Sci., 12 2016 109–113
  • GhobadiS., GhorbaninejadM., The forgotten topological index of four operations on some special graphs, Bull. Math. Sci. Appl., 16 2016 89–95
  • FurtulaB., GutmanI., Kovijanić VukićevićŽ., LekishviliG., PopivodaG., On an old/new degree–based topological index, Bull. Acad. Serbe Sci. Arts Cl. Sci. Math. Natur., 148 2015 19–31
  • GutmanI., GhalavandA., Dehghan-ZadehT., AshrafiA.R., Graphs with smallest forgotten index, Iran. J. Math. Chem., 8 2017 259–273
  • MilovanovićI.Ž., MilovanovićE.I., GutmanI., FurtulaB., Some inequalities for the forgotten topological index, Int. J. Appl. Graph Theory, 1 2017 1–15
  • AbdoH., DimitrovD., GutmanI., On extremal trees with respect to the F-index, Kuwait J. Sci., 44 2017 1–8
  • AkhterS., ImranM., Computing the forgotten topological index of four operations on graphs, AKCE Int. J. Graphs Comb., 14 2017 70–79
  • BasavanagoudB., DesaiV.R., Forgotten topological index and hyper–Zagreb index of generalized transformation graphs, Bull. Math. Sci. Appl., 14 2016 1–6
  • CheZ., ChenZ., Lower and upper bounds of the forgotten topological index, MATCH Commun. Math. Comput. Chem., 76 2016 635–648
  • GaoW., SiddiquiM.K., ImranM., JamilM.K., FarahaniM.R., Forgotten topological index of chemical structure in drugs, Saudi Pharma. J., 24 2016 258–264
  • AkhterS., ImranM., FarahaniM.R., Extremal unicyclic and bicyclic graphs with respect to the F-index, AKCE Int. J. Graphs Comb., 14 2017 80–91
  • DeN., Abu NayeemS.M., PalA., F-index of some graph operations, Discrete Math. Algorithms Appl., 8 2016 #1650025
  • MilovanovićI.Ž., MatejićM.M., MilovanovićE.I., Remark on the forgotten topological index of a line graph, Bull. Inter. Math. Virt. Inst., 7 2017 473–478
  • RandićM., On characterization of molecular branching, J. Am. Chem. Soc., 97 1975 6609–6615
  • KierL.B., HallL.H., Molecular Connectivity in Structure–Activity Analysis 1986Wiley New York
  • LiX., GutmanI., Mathematical Aspects of Randić–Type Molecular Structure Descriptors 2006Univ. Kragujevac Kragujevac
  • GutmanI., FurtulaB.Recent Results in the Theory of Randić Index2008Univ. Kragujevac Kragujevac
  • RandićM., NovičM., PlavšićD., Solved and Unsolved Problems in Structural Chemistry 2016CRC Press Boca Raton
  • BollobásB., ErdősP., Graphs of extremal weights, Ars Combin., 50 1998 225–233
  • BollobásB., ErdősP., SarkarA., Extremal graphs for weights, Discrete Math., 200 1999 5–19
  • CaversM., FallatS., KirklandS., On the normalized Laplacian energy and general Randić index R−1 of graphs, Linear Algebra Appl., 433 2010 172–190
  • PavlovićL., StojanovićM., LiX., More on the best upper bound for the Randić index R−1 of trees, MATCH Commun. Math. Comput. Chem., 60 2008 567–584
  • HuY., JinY., LiX., WangL., Maximum tree and maximum value for the Randić index R−1 of trees of order n≤102, MATCH Commun. Math. Comput. Chem., 55 2006 119–136
  • MilovanovićE.I., BekakosP.M., BekakosM.P., MilovanovićI.Ž., Sharp bounds for the general Randić index R−1 of a graph, Rockey Mountain J. Math., 47 2017 259–266
  • NikolićS., KovačevićG., MilićevićA., TrinajstićN., Modified Zagreb indices, Croat. Chem. Acta, 76 2003 113–124
  • BonchevD., Overall connectivity - a next generation molecular connectivity, J. Mol. Graphics Model., 20 2001 65–75
  • ZhouB., TrinajstićN., On a novel connectivity index, J. Math. Chem., 46 2009 1252–1270
  • MilovanovićI.Ž., MilovanovićE.I., MatejićM.M., Some inequalities for general sum-conectivity index, MATCH Commun. Math. Comput. Chem., 79 2018 477–489
  • MatejićM.M., MilovanovićE.I., MilovanovićI.Ž., Remark on sum-connectivity index, Appl. Math. Comput. Sci., 2 2017 13–17
  • DasK.C., DasS., ZhouB., Sum-conectivity index of a graph, Front. Math. China, 11 2016 47–54
  • ZhangL., The harmonic index for graphs, Appl. Math. Lett., 25 2012 561–566
  • ShirdelG.H., RezapourH., SayadiA.M., The hyper–Zagreb index of graph operations, Iran. J. Math. Chem., 4 2013 213–220
  • GutmanI., On hyper–Zagreb index and coindex, Bull. Acad. Serbe Sci. Arts Cl. Sci. Math. Natur., 150 2017 1–8
  • BasavanagoudB., PatilS., A note on hyper–Zagreb index of graph operations, Iran. J. Math. Chem., 7 2016 89–92
  • BasavanagoudB., PatilS., A note on hyper–Zagreb coindex of graph operations, J. Appl. Math. Comput., 53 2017 647–655
  • Falahati NezhadF., AzariM., Bounds on the hyper–Zagreb index, J. Appl. Math. Inform., 34 2016 319–330
  • GaoW., JamilM.K., FarahaniM.R., The hyper–Zagreb index and some graph operations, J. Appl. Math. Comput., 54 2017 263–275
  • LuoZ., Applications on hyper–Zagreb index of generalized hierarchical product graphs, J. Comput. Theor. Nanosci., 13 2016 7355–7361
  • VeylakiM., NikmehrM.J., The third and hyper–Zagreb coindices of some graph operations, J. Appl. Math. Comput., 50 2016 315–325
  • PattabiramanK., VijayaragavanM., Hyper Zagreb indices and its coindices of graphs, Bull. Int. Math. Virt. Inst., 7 2017 31–41
  • AlbertsonM.O., The irregularity of a graph, Ars Combin., 46 1997 219–225
  • Fath-TabarG.H., Old and new Zagreb indices of graphs, MATCH Commun. Math. Comput. Chem., 65 2011 79–84
  • GutmanI., ToganM., YurttasA., CevikA.S., CangulI.N., Inverse problem for sigma index, MATCH Commun. Math. Comput. Chem., 79 2018 491–508
  • I. Gutman, D. Dimitrov, H. Abdo, in preparation.
  • MiličevićA., NikolićS., TrinajstićN., On reformulated Zagreb indices, Mol. Diversity, 8 2004 393–399
  • ZhouB., TrinajstićN., Some properties of the reformulated zagreb index, J. Math. Chem., 48 2010 714–719
  • DeN., PalA., Abu NayeemS.M., Reformulated first Zagreb index of some graph operations, Mathematics, 3 2015 945–960
  • DeN., Some bounds of reformulated Zagreb indices, Appl. Math. Sci., 6 2012 5005–5012
  • GhalavandA., AshrafiA.R., Extremal trees with respect to the first and second reformulated Zagreb index, Malaya J. Mat., 5 2017 524–530
  • HaoJ., Relationship between modified Zagreb indices and reformulated modified Zagreb indices with respect to trees, Ars Combin., 121 2015 201–206
  • IlićA., ZhouB., On reformulated Zagreb indices, Discrete Appl. Math., 160 2012 204–209
  • JiS., LiX., HuoB., On reformulated Zagreb indices with respect to acyclic, unicyclic and bicyclic graphs, MATCH Commun. Math. Comput. Chem., 72 2014 723–732
  • JiS., QuY., LiX., The reformulated Zagreb indices of tricyclic graphs, Appl. Math. Comput., 268 2015 590–595
  • MansourT., RostamiM.A., SureshE., XavierG.B.A., On the bounds of the first reformulated Zagreb index, Turk. J. Anal. Number Theory, 4 2016 8–15
  • MilovanovićE.I., MilovanovićI.Ž., DolićaninE.Ć., GlogićE., A note on the first reformulated Zagreb index, Appl. Math. Comput., 273 2016 16–20
  • AramH., DehgardiN., Reformulated F-index of graph operations, Commun. Comb. Optim., 2 2017 87–98
  • MilovanovićE.I., MatejićM.M., MilovanovićI.Ž., Remark on lower bound for forgotten topological index, Sci. Publ. State Univ. Novi Pazar, Ser A: Appl. Math. Inform. Mech., 9 2017 19–24
  • KulliV.R., On K indices of graphs, Int. J. Fuzzy Math. Archive, 10 2016 105–109
  • KulliV.R., On K Banhatti indices of graphs, J. Comput. Math. Sci., 7 2016 213–218
  • GutmanI., KulliV.R., ChaluvarajuB., BoregowdaH.S., On Banhatti and Zagreb indices, Bull. Int. Math. Virt. Inst., 7 2017 53–67
  • KulliV.R., On K hyper–Banhatti indices and coindices of graphs, Int. Res. J. Pure Algebra, 6 2016 300–304
  • DošlićT., Vertex–weighted Wiener polynomials for composite graphs, Ars Math. Contemp., 1 2008 66–80
  • GutmanI., On coindices of graphs and their complements, Appl. Math. Comput., 305 2017 161–165
  • BasavanagoudB., GutmanI., GaliC.S., On second Zagreb index and coindex of some derived graphs, Kragujevac J. Sci., 37 2015 113–121
  • Das I. GutmanK.C., HoroldagvaB., Comparing Zagreb indices and coindices of trees, MATCH Commun. Math. Comput. Chem., 68 2012 189–198
  • LiuB., GutmanI., Upper bounds for Zagreb indices of connected graphs, MATCH Commun. Math. Comput. Chem., 55 2006 439–446
  • BindusreeA.R., LokeshaV., RanjiniP.S., Relation connecting Zagreb co-indices on three graph operators, Math. Aeterna, 3 2013 433–448
  • AshrafiA.R., DošlićT., HamzehA., The Zagreb coindices of graph operations, Discrete Appl. Math., 158 2010 1571–1578
  • AshrafiA.R., DošlićT., HamzehA., Extremal graphs with respect to the Zagreb coindices, MATCH Commun. Math. Comput. Chem., 65 2011 85–92
  • Baskar BabujeeJ., RamakrishnanS., Zagreb indices and coindices for compound graphs NadarajanR., LekshmiR.S., Sai Sundara KrishnanG.Computational and Mathematical Modeling2012Narosa New Delhi 357–362
  • Hossein-ZadehS., HamzehA., AshrafiA.R., Extermal properties of Zagreb coindices and degree distance of graphs, Miskolc Math. Notes, 11 2010 129–138
  • HuaH., AshrafiA., ZhangL., More on Zagreb coindices of graphs, Filomat, 26 2012 1215–12205
  • HuaH., ZhangS., Relations between Zagreb coindices and some distance–based topological indices, MATCH Commun. Math. Comput. Chem., 68 2012 199–208
  • Kovijanić VukićevićŽ., PopivodaG., Chemical trees with extreme values of Zagreb indices and coindices, Iran. J. Math. Chem., 5 2014 19–29
  • MilovanovićE., MilovanovićI., Sharp bounds for the first Zagreb index and first Zagreb coindex, Miskolc Math. Notes, 16 2015 1017–1024
  • WangM., HuaH., More on zagreb coindices of composite graphs, Internat. Math. Forum, 7 2012 669–673
  • YangL., AiX., ZhangL., The Zagreb coindices of a type of composite graphs, Hacettepe J. Math. Statist., 45 2016 1135–1142
  • RizwanaA., JeyakumarG., SomasundaramS., On the non-neighbor Zagreb indices and non-neighbor harmonic index, Int. J. Math. Appl., 4 2016 89–101
  • FurtulaB., GutmanI., EdizS., On difference of Zagreb indices, Discrete Appl. Math., 178 2014 83–88
  • GutmanI., FurtulaB., ElphickC., Three new/old vertex–degree–based topological indices, MATCH Commun. Math. Comput. Chem., 72 2014 617–682
  • HoroldagvaB., Relations between the first and second Zagreb indices of graphs GutmanI., FurtulaB., DasK.C., MilovanovićE., MilovanovićI.Bounds in Chemical Graph Theory –Mainstreams2017Univ. Kragujevac Kragujevac 69–81
  • HoroldagvaB., BuyantogtokhL., DorjsembeS., Difference of Zagreb indices and reduced second Zagreb index of cyclic graphs with cut edges, MATCH Commun. Math. Comput. Chem., 78 2017 337–350
  • HoroldagvaB., DasK.C., SelengeT., Complete characterization of graphs for direct comparing Zagreb indices, Discrete Appl. Math., 215 2016 146–154
  • NajiA.M., SonerN.D., GutmanI., On leap Zagreb indices of graphs, Commun. Comb. Optim., 2 2017 99–117
  • YamaguchiS., Estimating the Zagreb indices and the spectral radius of triangle–and quadrangle–free connected graphs, Chem. Phys. Lett., 458 2008 396–398
  • NarumiH., KatayamaM., Simple topological index. A newly devised index characterizing the topological nature of structural isomers of saturated hydrocarbons, Mem. Fac. Engin. Hokkaido Univ., 16 1984 209–214
  • Jafari RadN., JahanbaniA., GutmanI., Zagreb energy and Zagreb Estrada index of graphs, MATCH Commun. Math. Comput. Chem., 79 2018 371–386