%0 Journal Article
%T Nordhaus-Gaddum type results for the Harary index of graphs
%J Iranian Journal of Mathematical Chemistry
%I University of Kashan
%Z 2228-6489
%A Wang, Z.
%A Mao, Y.
%A Wang, X.
%A Wang, C.
%D 2017
%\ 06/01/2017
%V 8
%N 2
%P 181-198
%! Nordhaus-Gaddum type results for the Harary index of graphs
%K Distance
%K Steiner distance
%K Harary index
%K K-center Steiner Harary index
%R 10.22052/ijmc.2017.67735.1254
%X The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the emph{Steiner distance} $d_G(S)$ of the vertices of $S$ is the minimum size of a connected subgraph whose vertex set contains $S$. Recently, Furtula, Gutman, and Katani'{c} introduced the concept of Steiner Harary index and gave its chemical applications. The emph{$k$-center Steiner Harary index} $SH_k(G)$ of $G$ is defined by $SH_k(G)=sum_{Ssubseteq V(G),|S|=k}frac{1}{d_G(S)}$. In this paper, we get the sharp upper and lower bounds for $SH_k(G)+SH_k(overline{G})$ and $SH_k(G)cdot SH_k(overline{G})$, valid for any connected graph $G$ whose complement $overline {G}$ is also connected.
%U http://ijmc.kashanu.ac.ir/article_44759_734363f6c618442af36682e65ea7a7b1.pdf