A graph G in which there is an edge joining every pair of distinct vertices; every vertex is adjacent to every other vertex. If G contains n vertices then the number of edges is
n(n - 1)/2
Basic Computer Science
Operating Systems
Database Management System
Questions and Answers
Home Dictionary Contact us About us Privacy policy Link to us Advertise
Copy right © 2012