Distance-transitive 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 03:3403:34, 29 May 2012Vipul talk contribs 1,492 bytes +1,492 Created page with "{{undirected graph property}} ==Definition== An undirected graph <math>G</math> is termed a '''distance-transitive graph''' if the following is true for every positive i..."