Information for "The Degree Diameter Problem for Circulant Graphs"
From Combinatorics Wiki
Basic information
Display title | The Degree Diameter Problem for Circulant Graphs |
Default sort key | The Degree Diameter Problem for Circulant Graphs |
Page length (in bytes) | 40,500 |
Page ID | 150 |
Page content language | en-gb - British English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Page protection
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Edit history
Page creator | CW>Grahame.erskine |
Date of page creation | 13:30, 29 January 2017 |
Latest editor | Roblewis (talk | contribs) |
Date of latest edit | 09:24, 24 November 2019 |
Total number of edits | 53 |
Total number of distinct authors | 3 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |