Information for "The Degree Diameter Problem for Vertex Transitive Graphs"
From Combinatorics Wiki
Basic information
Display title | The Degree Diameter Problem for Vertex Transitive Graphs |
Default sort key | The Degree Diameter Problem for Vertex Transitive Graphs |
Page length (in bytes) | 93 |
Page ID | 157 |
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>Eyal |
Date of page creation | 22:53, 16 January 2009 |
Latest editor | Grahame (talk | contribs) |
Date of latest edit | 14:39, 3 January 2019 |
Total number of edits | 2 |
Total number of distinct authors | 2 |
Recent number of edits (within past 90 days) | 0 |
Recent number of distinct authors | 0 |