Complete bipartite graph:K3,3

From Graph
Revision as of 17:17, 29 May 2012 by Vipul (talk | contribs) (Created page with "{{particular undirected graph}} ==Definition== This undirected graph is defined as the complete bipartite graph <math>K_{3,3}</math>. Explicitly, it is a graph on si...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs

Definition

This undirected graph is defined as the complete bipartite graph . Explicitly, it is a graph on six vertices divided into two subsets of size three each, with edges joining every vertex in one subset to every vertex in the other subset.

Retrieved from "https://graph.subwiki.org/w/index.php?title=Complete_bipartite_graph:K3,3&oldid=187"