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