Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices
2019 ◽
Vol 29
(2)
◽
pp. 193-202
◽
Keyword(s):
The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G. We characterize, with a new elegant proof, those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order n. Then, given two integers n and p with p ? n - 1, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order n with p pendant vertices.
2018 ◽
Vol 10
(05)
◽
pp. 1850065
◽
2018 ◽
Vol 3
(1)
◽
pp. 209-228
◽
2018 ◽
Vol 13
(01)
◽
pp. 2050028
◽
Keyword(s):
2018 ◽
Vol 74
(1-2)
◽
pp. 25-33
◽
2018 ◽
Vol 12
(2)
◽
pp. 297-317