• semi-complete

semi-complete (suomeksi)

Määritelmät:

• partially complete
• (lb, en, mathematics, graph theory) of or pertaining to a graph in which, for any two vertex, verticies $u$, $v$ in the graph, there is another vertex $w$ which is adjacent to both $u$ and $v$ (i.e. $\backslash \{u,\; w,\; v\backslash \}$ is a path in that graph).Rao, IH Naga Raja, and SV Siva Rama Raju. "[http://www.yangsky.com/ijcc/pdf/ijcc738.pdf Semi-complete graphs]." ''INTERNATIONAL JOURNAL OF COMPUTATIONAL COGNITION (HTTP://WWW.IJCC.US)'' 7.3 (2009).