semi-complete
See also: semicomplete
English
editAlternative forms
editEtymology
editAdjective
editsemi-complete (not comparable)
- partially complete
- (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- ^ Rao, IH Naga Raja, and SV Siva Rama Raju. "Semi-complete graphs." INTERNATIONAL JOURNAL OF COMPUTATIONAL COGNITION (HTTP://WWW.IJCC.US) 7.3 (2009).