Sharp Lower Bound of Cacti Graph with respect to Zagreb Eccentricity Indices
The first Zagreb eccentricity index E1℧ is the sum of square of eccentricities of the vertices, and the second Zagreb eccentricity index E2℧ is the sum of product squares of the eccentricities of the vertices. A linked graph G is called a cactus if any two of its cycles share only one vertex. In oth...
Saved in:
Main Authors: | Ahmed Alamer, Khalil Hadi Hakami, Mohammad Rahim Rahimi, Yasir Ahmad |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2024-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2024/1677218 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Sharp Bounds of the Hyper-Zagreb Index on Acyclic, Unicylic, and Bicyclic Graphs
by: Wei Gao, et al.
Published: (2017-01-01) -
Zagreb Eccentricity Indices of the Generalized Hierarchical Product Graphs and Their Applications
by: Zhaoyang Luo, et al.
Published: (2014-01-01) -
Lower Bounds on the Entire Zagreb Indices of Trees
by: Liang Luo, et al.
Published: (2020-01-01) -
Introducing New Exponential Zagreb Indices for Graphs
by: Nihat Akgunes, et al.
Published: (2021-01-01) -
Matchings in hexagonal cacti
by: E. J. Farrell
Published: (1987-01-01)