Given a graph whose edges never fail but whose nodes fail independently of each other with a constant probability 1 − p, the reliability of a graph is defined to be the probability that the induced subgraph of the surviving nodes is connected. Let Ω(n, m) be the class of all graphs with n nodes and m edges. A graph G of Ω is said to be uniformly best in Ω, if for all choices of p, it is most reliable in the class of graphs. In this paper, the existing known set of uniformly best graphs is extended, and some closely related graphs are proved to be not the uniformly best graphs in their class. More precisely, we prove that for any positive integer b the complete tripartite graph K(b, b + 1, b + 2) is uniformly best in its class Ω(3b + 3, 3b2 + 6b + 2), while the complete tripartite graphs K(b, b + 1, B + i) (i > 2) are not the uniformly best in their classes Ω(3b + i + 1, 3b2 + 2(i + 1)b + i).
