Abstract
Let G be a simple graph with n vertices and m edges. The first hyper Zagreb index of G is defined as HM1(G) = Σ uv∈E(G)(d(u) + d(v))2, where d(v) denotes the degree of a vertex v in G. The aim of this paper is to correct some of the inequalities that were derived in [9] and characterize the extremal graphs.
| Original language | English |
|---|---|
| Pages (from-to) | 637-642 |
| Number of pages | 6 |
| Journal | Mathematical Reports |
| Volume | 24-74 |
| Issue number | 4 |
| State | Published - 2022 |
Bibliographical note
Publisher Copyright:© 2022 Editura Academiei Romane. All rights reserved.
Keywords
- Minimum degree
- Zagreb indices
- hyper-Zagreb indices
- maximum degree
ASJC Scopus subject areas
- Analysis
- Algebra and Number Theory
- Geometry and Topology
- Applied Mathematics