Home » Embedding Complete Bipartite Graphs with Cayley Maps » Complete Bipartite Graph Kp,p

Complete Bipartite Graph Kp,p

K_{3,3}

Complete Bipartite Graphs
A graph is a complete bipartite graph K_{n,n} if and only if it has 2n vertices, where the vertices are split into two sets, with n vertices in each set. Every vertex of the first set is adjacent to every vertex of the second set, but no vertex is adjacent to another vertex in its same set.