On distance in complements of graphs
Authors: Gutman Ivana, Lu Jia, Boutiche Mohamed-Amine
Keywords: Distance (in graph); complement (of graph); Wiener index; hyper-Wiener index
Abstract:
Let G be a graph with n vertices and m edges. In many cases the complement of G has the following properties: it is connected, its diameter is 2, its Wiener index is equal to (n 2) + m, and its hyper-Wiener index is equal to (n 2) + 2m. We characterize the graphs whose complements have the mentioned properties.
References:
[1] Buckley, F., Harary, F. (1990) Distance in graphs. Redwood City: Addison-Wesley
[2] Harary, F. (1969) Graph theory. Reading: Addison-Wesley
[3] Senbagamalar, J., Babujee, B.J., Gutman, I. (2014) On Wiener index of graph complements. Trans. Comb, Vol. 3, 2, 11-15
[4] Xu, K., Liu, M., Das, K.C., Gutman, I., Furtula, B. (2014) A survey on graphs extremal with respect to distance-based topological indices. MATCH Commun. Math. Comput. Chem, Vol. 71, 3, 461-508