Comparing Wiener complexity with eccentric complexity (Q827592)

Let \(G\) be an undirected simple connected graph of finite order. If \(v\) is any vertex of \(G,\) then the sum of distances from \(v\) to all other vertices of \(G\) is called the transmission of \(v\) while, the maximum distance of \(v\) from any other vertex of \(G\) is called the eccentricity of \(v.\) The number of different transmissions \(C_{W}\) of \(G\) is defined as Wiener complexity and the number of different eccentricities \(C_{ec}\) of \(G\) is named as eccentric complexity of \(G\). The focus point of this paper is the comparison of these two convexities. In [\textit{ Y. Alizadeh} et al., Bull. Malays. Math. Sci. Soc. (2) 42, No. 4, 1607--1623 (2019; Zbl 1418.05060)], it is proved that for any two graphs \(G\) and \(H,\) \(C_{ec}( G\Box H) =C_{ec}( G) +C_{ec}( H) -1,\) holds. Here, the authors prove: \(C_{W}( G\square H) \geq C_{W}( G) +C_{W}( H) -1 \) for any two graphs. In the next result, they show \(C_{W}( G\square H)=C_{W}( G) C_{W}( H)\) by introducing two new families of graphs. In the comparison of these two complexities some results are given. One of these results says: \(C_{ec} \leq C_{W}\) is true for almost all graphs. And, they tested this property for trees. For the reverse inequality, infinite families of graphs constructed by amalgamating universally diametrical graphs with center-regular trees are presented.