[go: up one dir, main page]

See also: semicomplete

English

edit

Alternative forms

edit

Etymology

edit

From semi- +‎ complete.

Adjective

edit

semi-complete (not comparable)

  1. partially complete
  2. (mathematics, graph theory) of or pertaining to a graph in which, for any two verticies  ,   in the graph, there is another vertex   which is adjacent to both   and   (i.e.   is a path in that graph).[1]

References

edit
  1. ^ Rao, IH Naga Raja, and SV Siva Rama Raju. "Semi-complete graphs." INTERNATIONAL JOURNAL OF COMPUTATIONAL COGNITION (HTTP://WWW.IJCC.US) 7.3 (2009).