Elsevier

Discrete Applied Mathematics

Volume 219, 11 March 2017, Pages 167-175
Discrete Applied Mathematics

Nordhaus–Gaddum-type results for the Steiner Wiener index of graphs

https://doi.org/10.1016/j.dam.2016.11.014Get rights and content
Under an Elsevier user license
open archive

Abstract

The Wiener index W of a connected graph G with vertex set V(G) is defined as W=u,vV(G)d(u,v) where d(u,v) stands for the distance between the vertices u and v of G. For SV(G), the Steiner distance d(S) of the vertices of S is the minimum size of a connected subgraph of G whose vertex set contains S. The kth Steiner Wiener index SWk(G) of G is defined as the sum of Steiner distances of all k-element subsets of V(G). In 2005, Zhang and Wu studied the Nordhaus–Gaddum problem for the Wiener index. We now obtain analogous results for SWk, namely sharp upper and lower bounds for SWk(G)+SWk(G¯) and SWk(G)SWk(G¯), valid for any connected graph G whose complement G¯ is also connected.

Keywords

Distance (in graph)
Steiner distance
Wiener index
Steiner Wiener index
Nordhaus–Gaddum relations

Cited by (0)

Supported by the National Science Foundation of China (Nos. 11551001,11161037,11461054) and the Science Found of Qinghai Province (No. 2014-ZJ-907).