科研之友
微信
新浪微博
Facebook
分享链接
摘要
The connective eccentricity index (CEI) of a connected graph G is defined as xi ee(G)= Sigma(u is an element of VG) [d(G)(u)/epsilon(G)(u)], where d(G)(u) and epsilon(G)(u) are the degree and eccentricity, respectively, of the vertex u is an element of V-G of G. In this paper, graphs with the maximum CEI are characterized from the class of all connected graphs of a fixed order and size. Graphs having maximum CEI are also determined from some other well-known classes of connected graphs of a given order; namely, the Halin graphs, triangle-free graphs, planar graphs and outer-planar graphs.
