Title : ( Leap eccentric connectivity index in graphs with universal vertices )
Authors: , Sandi Klavzar , Mostafa Tavakoli , Mardjan Hakimi-Nezhaad , Freydoon Rahbarnia ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
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
@article{paperid:1091360,
author = {, and Sandi Klavzar and Tavakoli, Mostafa and Mardjan Hakimi-Nezhaad and Rahbarnia, Freydoon},
title = {Leap eccentric connectivity index in graphs with universal vertices},
journal = {Applied Mathematics and Computation},
year = {2023},
volume = {436},
month = {January},
issn = {0096-3003},
pages = {127519--127526},
numpages = {7},
keywords = {Eccentricity
Leap eccentric connectivity index
Diameter
Universal vertex
Tree},
}
%0 Journal Article
%T Leap eccentric connectivity index in graphs with universal vertices
%A ,
%A Sandi Klavzar
%A Tavakoli, Mostafa
%A Mardjan Hakimi-Nezhaad
%A Rahbarnia, Freydoon
%J Applied Mathematics and Computation
%@ 0096-3003
%D 2023
