Leap Eccentric Connectivity Index of Subdivision Graphs

Ali Ghalavand, Shiladhar Pawar, Nandappa D. Soner and Muhammad Kamran Jamil

Journal of Mathematics, 2022, vol. 2022, 1-7

Abstract: The second degree of a vertex in a simple graph is defined as the number of its second neighbors. The leap eccentric connectivity index of a graph M, LξcM, is the sum of the product of the second degree and the eccentricity of every vertex in M. In this paper, some lower and upper bounds of LξcSM in terms of the numbers of vertices and edges, diameter, and the first Zagreb and third leap Zagreb indices are obtained. Also, the exact values of LξcSM for some well-known graphs are computed.

Date: 2022
References: Add references at CitEc
Citations:

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

DOI: 10.1155/2022/7880336

Access Statistics for this article

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