Extremal Values on the General Degree–Eccentricity Index of Unicyclic Graphs of Fixed Diameter

Mesfin Masre

Journal of Mathematics, 2025, vol. 2025, 1-9

Abstract: For a connected graph G and two real numbers a,b, the general degree–eccentricity index of G is given by DEIa,bG=∑v∈VGdGavecGbv, where VG represent the vertex set of graph G, dGv denotes the degree of vertex v, and ecGv is the eccentricity of v in G, that is, the maximum distance from v to another vertex of G. This index generalizes several well-known “topological indices†of graphs such as the eccentric connectivity index. We characterize the unique unicyclic graph with the maximum general degree–eccentricity index for the case a≥1,b≤0 and the minimum general degree–eccentricity index for the case 0≤a≤1,b≥0, among all n-vertex unicyclic graphs with fixed order and diameter.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2025/8747918.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2025/8747918.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:8747918

DOI: 10.1155/jom/8747918

Access Statistics for this article

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