Leap eccentric connectivity index in graphs with universal vertices

Ali Ghalavand, Sandi Klavžar, Mostafa Tavakoli, Mardjan Hakimi-Nezhaad and Freydoon Rahbarnia

Applied Mathematics and Computation, 2023, vol. 436, issue C

Abstract: For a graph X, the leap eccentric connectivity index (LECI) is ∑x∈V(X)d2(x,X)ε(x,X), where d2(x,X) is the 2-distance degree and ε(x,X) the eccentricity of x. We establish a lower and an upper bound for the LECI of X in terms of its order and the number of universal vertices, and identify the extremal graphs. We prove an upper bound on the index for trees of a given order and diameter, and determine the extremal trees. We also determine trees with maximum LECI among all trees of a given order.

Keywords: Eccentricity; Leap eccentric connectivity index; Diameter; Universal vertex; Tree (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322005938
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:436:y:2023:i:c:s0096300322005938

DOI: 10.1016/j.amc.2022.127519

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().