Timeline for Counting graphs with diameter d
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2012 at 11:01 | vote | accept | nomatter | ||
| Oct 12, 2012 at 23:32 | answer | added | Brendan McKay | timeline score: 4 | |
| Oct 12, 2012 at 20:39 | comment | added | Robert Young | There are infinitely many graphs with diameter 2 -- take a n-pointed star for any n. I usually try to find results like this by calculating the first couple terms of the sequence and then searching the Online Encyclopedia of Integer Sequences. I wasn't able to find an answer to your exact question, but the sequence oeis.org/A204329 seems relevant. | |
| Oct 12, 2012 at 19:19 | history | asked | nomatter | CC BY-SA 3.0 |