TY - JOUR
ID - 44759
TI - Nordhaus-Gaddum type results for the Harary index of graphs
JO - Iranian Journal of Mathematical Chemistry
JA - IJMC
LA - en
SN - 2228-6489
AU - Wang, Z.
AU - Mao, Y.
AU - Wang, X.
AU - Wang, C.
AD - Beijing Normal Unviersity
AD - Qinghai Normal Unviersity
AD - Qinghai Normal University
Y1 - 2017
PY - 2017
VL - 8
IS - 2
SP - 181
EP - 198
KW - Distance
KW - Steiner distance
KW - Harary index
KW - K-center Steiner Harary index
DO - 10.22052/ijmc.2017.67735.1254
N2 - 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.
UR - http://ijmc.kashanu.ac.ir/article_44759.html
L1 - http://ijmc.kashanu.ac.ir/article_44759_734363f6c618442af36682e65ea7a7b1.pdf
ER -