English

Hyper Zagreb Index of Bridge and Chain Grpahs

Discrete Mathematics 2017-03-27 v1 Combinatorics

Abstract

Let G be a simple connected molecular graph with vertex set V(G)V(G) and edge set E(G)E(G). One important modification of classical Zagreb index, called hyper Zagreb index HM(G)HM(G) is defined as the sum of squares of the degree sum of the adjacent vertices, that is, sum of the terms [dG(u)+dG(v)]2[{d_G}(u)+{d_G}(v)]^2 over all the edges of GG, where dG(u){d_G}(u) denote the degree of the vertex uu of GG. In this paper, the hyper Zagreb index of certain bridge and chain graphs are computed and hence using the derived results we compute the hyper Zagreb index of several classes of chemical graphs and nanostructures.

Keywords

Cite

@article{arxiv.1703.08325,
  title  = {Hyper Zagreb Index of Bridge and Chain Grpahs},
  author = {Nilanjan De},
  journal= {arXiv preprint arXiv:1703.08325},
  year   = {2017}
}

Comments

13 pages