Given a connected graph G, the eccentricity epsilon G(v) of a vertex v in G is the maximum distance from v to any other vertex, in which the vertex v satisfying epsilon G(v) = max{epsilon G(u) : u E VG} is called a peripheral vertex. The normality of a vertex v is the minimum distance from v to all peripheral vertices in G. The sum of normalities of G is denoted by Norm(G). The difference between the eccentricity and normality at a vertex v is denoted by lambda G(v). Let Lambda(G) = n-ary sumation vEV(G)lambda G(v). Very recently, Chen, Wang and Zhang (Chen et al., 2020) started a new research...
