Timeline for Estimation of DS graph growth
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 27, 2011 at 18:01 | vote | accept | Shahrooz | ||
| Dec 26, 2011 at 19:43 | comment | added | Shahrooz | Dear McKay, I found a paper with name "Cospectral graphs on 12 vertices"(A. E. Brouwer, E. Spence). | |
| Dec 26, 2011 at 14:24 | comment | added | Brendan McKay | Shahrooz's first line is a definition, even though it doesn't look like one. A graph is DS if it is the only graph whose adjacency matrix has that characteristic polynomial. This is not standard terminology. | |
| Dec 26, 2011 at 12:02 | comment | added | Igor Rivin | For us ignoramus, what ARE DS graphs? | |
| Dec 26, 2011 at 1:47 | history | answered | Brendan McKay | CC BY-SA 3.0 |