2018Electronic Journal of Graph Theory and ApplicationsOpen access

New bounds on the hyper-Zagreb index for the simple connected graphs

Suresh Elumalai, Toufik Mansour, M. Ali Rostami

Open full text 6 citations

Abstract

The hyper-Zagreb index of a simple connected graph G is defined by χ 2 ( G ) = ∑ u v ∈ E ( G ) ( d ( u ) + d ( v )) 2 . In this paper, we establish, analyze and compare some new upper bounds on the Hyper-Zagreb index in terms of the number of vertices n , number of edges m , maximum vertex degree Δ , and minimum vertex degree δ , first Zagreb index M 1 ( G ) , second Zagreb index M 2 ( G ) , harmonic index H ( G ) , and inverse edge degree I E D ( G ) . In addition, we give the identities on Hyper-Zagreb index and its coindex for the simple connected graphs.

Open-access reader

About this research paper

What this paper is about

The hyper-Zagreb index of a simple connected graph G is defined by χ 2 ( G ) = ∑ u v ∈ E ( G ) ( d ( u ) + d ( v )) 2 . In this paper, we establish, analyze and compare some new upper bounds on the Hyper-Zagreb index in terms of the number of vertices n , number of edges m , maximum vertex degree Δ , and minimum vertex degree δ , first Zagreb index M 1 ( G ) , second Zagreb index M 2 ( G ) , harmonic index H ( G ) , and inverse edge degree I E D ( G ) . In addition, we give the identities on Hyper-Zagreb index and its coindex for the simple connected graphs.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The hyper-Zagreb index of a simple connected graph G is defined by χ 2 ( G ) = ∑ u v ∈ E ( G ) ( d ( u ) + d ( v )) 2 . In this paper, we establish, analyze and compare some new upper bounds on the Hyper-Zagreb index in terms of the number of vertices n , number of edges m , maximum vertex degree Δ , and minimum vertex degree δ , first Zagreb index M 1 ( G ) , second Zagreb index M 2 ( G ) , harmonic index H ( G ) , and inverse edge degree I E D ( G ) . In addition, we give the identities on Hyper-Zagreb index and its coindex for the simple connected graphs.

Key concepts: Combinatorics, Connectivity, Mathematics, Vertex (graph theory), Simple graph, Simple (philosophy), Inverse, Degree (music)

Related papers

Back to paper searchBrowse research topicsOriginal source
New bounds on the hyper-Zagreb index for the simple connected graphs — Research Paper | ScholarLens