When the vertices fail independently with each other by a constant probability,the reliability of a sraph is defined to be the probability that the graph results from deleting thefailed venices together with the incidence edges is connected. The Harary graph,a class of graphswith the best connectivity is considered in this paper,the bound of it's reliability is obtained,and theasymptotic property of reliability is also analysed.
