Please use this identifier to cite or link to this item:
Title: Nordhaus–Gaddum-type results for the Steiner Wiener index of graphs
Authors: Mao Y.
Wang Z.
Gutman, Ivan
Li H.
Issue Date: 2017
Abstract: © 2016 Elsevier B.V. The Wiener index W of a connected graph G with vertex set V(G) is defined as W=∑u,v∈V(G)d(u,v) where d(u,v) stands for the distance between the vertices u and v of G. For S⊆V(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.
Type: article
DOI: 10.1016/j.dam.2016.11.014
ISSN: 0166-218X
SCOPUS: 2-s2.0-85008235337
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)




Files in This Item:
File Description SizeFormat 
  Restricted Access
29.86 kBAdobe PDFThumbnail

Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.