Sharp Lower Bound of Cacti Graph with respect to Zagreb Eccentricity Indices

Ahmed Alamer, Khalil Hadi Hakami, Mohammad Rahim Rahimi, Yasir Ahmad and Xiaogang Liu

Journal of Mathematics, 2024, vol. 2024, 1-17

Abstract: 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 other words, there are no two independent cycles that share an edge. Cactus graphs are also known as “block graphs†or “sensitized graphs.†They are closely related to chordal graphs and can be used to represent various types of networks, including communication networks and road networks. In this contribution, E1℧ and E2℧ values of cacti with k pendant vertices and k cycles, respectively, are considered. We determine the minimum E1,E2 indices for n order cacti with k pendant vertices and k cycles.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2024/1677218.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2024/1677218.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:1677218

DOI: 10.1155/2024/1677218

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().