Hyper Zagreb Index of Bridge and Chain Grpahs

2017/03/24 by Nilanjan De, De, Nilanjan
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topics in Algebra #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications

paper · pdf · doi:10.48550/arxiv.1703.08325

openalex publication_date 2017/03/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a simple connected molecular graph with vertex set V(G) and edge set E(G). One important modification of classical Zagreb index, called hyper Zagreb index HM(G) is defined as the sum of squares of the degree sum of the adjacent vertices, that is, sum of the terms [d_G(u)+d_G(v)]² over all the edges of G, where d_G(u) denote the degree of the vertex u of G. 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.

Related

• Bounds of Zagreb indices and hyper Zagreb indices
• The Hyper-Zagreb Index of Trees and Unicyclic Graphs
• Sharp Bounds for Generalized Zagreb Indices of Graphs
• On Neighbourhood Zagreb index of product graphs
• On the maximum and minimum multiplicative Zagreb indices of graphs with given number of cut edges