A complete graph on n nodes, denoted by Kn, is a graph whose edges connect every node to every other node. K12 is shown in the figure below.
Page:
Context:
Rosalind is a platform for learning bioinformatics through problem solving. Please login with Google/Twitter/Facebook or register a new account.
