Title of article
ECCENTRIC CONNECTIVITY INDEX AND ECCENTRIC DISTANCE SUM OF SOME GRAPH OPERATIONS
Author/Authors
وومار، الكين نويسنده College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P.R. China Vumar, Elkin , اسكندر، بوزوهراگول نويسنده College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P.R. China Eskender, Buzohragul
Issue Information
فصلنامه با شماره پیاپی 0 سال 2013
Pages
9
From page
103
To page
111
Abstract
Let G = (V;E) be a connected graph. The eccentric connectivity index of G, c(G),
is defined as c(G) = Pv2V (G) deg(v)ec(v), where deg(v) is the degree of a vertex v and ec(v) is
its eccentricity. The eccentric distance sum of G is defined as d(G) = Pv2V (G) ec(v)D(v), where
D(v) = Pu2V (G) d(u; v). In this paper, we calculate the eccentric connectivity index and eccentric
distance sum of generalized hierarchical product of graphs. Moreover, we present the exact formulae
for the eccentric connectivity index of F-sum graphs in terms of some invariants of the factors.
Journal title
Transactions on Combinatorics
Serial Year
2013
Journal title
Transactions on Combinatorics
Record number
842151
Link To Document