In this paper, we consider upper bound graphs and double bound graphs of posets. We obtain a characterization of upper bound graphs whose complements are also upper bound graphs as follows: for a connected graph G, both G and G are upper bound graphs if and only if G is a split graph with V(G)= K + S, where K is a clique and S is an independent set, satisfying one of the following conditions: (...