http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Distance Eccentric Connectivity Index of Graphs
Akram Alqesmah,Anwar Saleh,R. Rangarajan,Aysun Yurttas Gunes,Ismail Naci CANGUL 경북대학교 자연과학대학 수학과 2021 Kyungpook mathematical journal Vol.61 No.1
Let G = (V, E) be a connected graph. The eccentric connectivity index of G is defined by ξC (G) = ∑u∈V (G) deg(u)e(u), where deg(u) and e(u) denote the degree and eccentricity of the vertex u in G, respectively. In this paper, we introduce a new formulation of ξC that will be called the distance eccentric connectivity index of G and defined by ξDe(G) = ∑u∈V (G) degDe(u)e(u) where degDe(u) denotes the distance eccentricity degree of the vertex u in G. The aim of this paper is to introduce and study this new topological index. The values of the eccentric connectivity index is calculated for some fundamental graph classes and also for some graph operations. Some inequalities giving upper and lower bounds for this index are obtained.