Lower Bounds on the Entire Zagreb Indices of Trees
For a (molecular) graph G, the first and the second entire Zagreb indices are defined by the formulas M1εG=∑x∈VG∪EGdx2 and M2εG=∑x is either adjacent or incident to ydxdy in which dx represents the degree of a vertex or an edge x. In the current manuscript, we establish some lower bounds on the firs...
Saved in:
Main Authors: | Liang Luo, Nasrin Dehgardi, Asfand Fahad |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2020-01-01
|
Series: | Discrete Dynamics in Nature and Society |
Online Access: | http://dx.doi.org/10.1155/2020/8616725 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Third Leap Zagreb Index for Trees
by: Jia-Ming Zhu, et al.
Published: (2019-01-01) -
Sharp Lower Bound of Cacti Graph with respect to Zagreb Eccentricity Indices
by: Ahmed Alamer, et al.
Published: (2024-01-01) -
Modified Zagreb Connection Indices for Benes Network and Related Classes
by: Wenhu Wang, et al.
Published: (2022-01-01) -
Some Upper Bounds on the First General Zagreb Index
by: Muhammad Kamran Jamil, et al.
Published: (2022-01-01) -
Erratum to “Reverse Zagreb and Reverse Hyper-Zagreb Indices for Crystallographic Structure of Molecules”
by: Zhen Wang, et al.
Published: (2020-01-01)