Timeline for Can we count isospectral graphs?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| S Feb 24, 2016 at 13:01 | history | suggested | emiliocba |
Added a new tag
|
|
| Feb 24, 2016 at 12:51 | review | Suggested edits | |||
| S Feb 24, 2016 at 13:01 | |||||
| Sep 27, 2014 at 7:14 | answer | added | Brendan McKay | timeline score: 5 | |
| Sep 27, 2014 at 6:21 | comment | added | Gerry Myerson | The question is not clear to me. Suppose that, for some $n$, there are 737 graphs, including one set of 3 isospectral graphs, and one set of 4. Would you say there are 2 isospectral graphs? would you say 4? would you say 7? | |
| Sep 27, 2014 at 3:02 | history | asked | user6818 | CC BY-SA 3.0 |