ABSTRACT Let G be a simple connected graph with vertex set . The connective eccentricity index (CEI) of a graph is defined as , where , denote the eccentricity and… Click to show full abstract
ABSTRACT Let G be a simple connected graph with vertex set . The connective eccentricity index (CEI) of a graph is defined as , where , denote the eccentricity and the degree of v, respectively. In this paper, we further study the CEI of trees and unicyclic graphs with several graph constraints, we also determine the extremal graphs.
               
Click one of the above tabs to view related content.