semi-complete

partially complete

(mathematics, graph theory) of or pertaining to a graph in which, for any two verticies u, v in the graph, there is another vertex w which is adjacent to both u and v (i.e. u,w,v is a path in that graph).