Dihedral graph: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

29 May 2012

  • curprev 17:0417:04, 29 May 2012Vipul talk contribs 567 bytes +567 Created page with "{{undirected graph family}} ==Definition== Let <math>n</math> be a natural number that is at least 3. The '''dihedral graph''' on <math>2n</math> vertices is defined in the ..."