Cycle graph:C5

From Graph
Revision as of 03:51, 28 May 2012 by Vipul (talk | contribs) (Created page with "{{particular undirected graph}} ==Definition== This undirected graph is defined in the following equivalent ways: # It is the cycle graph on 5 vertices, i.e., the g...")
(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 in the following equivalent ways:

  1. It is the cycle graph on 5 vertices, i.e., the graph
  2. It is the Paley graph corresponding to the field of 5 elements
  3. It is the unique (up to graph isomorphism) self-complementary graph on a set of 5 vertices