Timeline for Classes of graphs for which isospectrum implies isomorphism?
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 26, 2021 at 3:23 | history | edited | Tony Huynh | CC BY-SA 4.0 |
edited tags; edited title
|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| S Feb 24, 2016 at 14:16 | history | suggested | emiliocba | CC BY-SA 3.0 |
Added a new tag
|
| Feb 24, 2016 at 14:01 | review | Suggested edits | |||
| S Feb 24, 2016 at 14:16 | |||||
| Mar 6, 2011 at 21:27 | vote | accept | Suresh Venkat | ||
| Dec 13, 2010 at 23:17 | comment | added | Tony Huynh | I think the answer to this question certainly does depend on whether you use the adjacency matrix or the Laplacian. But it doesn't really matter for the related question: are almost all graphs determined by their spectra? This is because basically for regular graphs all the different notions of spectra coincide. | |
| Dec 13, 2010 at 23:10 | comment | added | Suresh Venkat | That's something I was wondering about as well. the references mostly talk about the adjacency matrix. | |
| Dec 13, 2010 at 22:53 | comment | added | Qiaochu Yuan | Is the answer to this question expected to be substantially the same for the adjacency matrix and the Laplacian? | |
| Dec 13, 2010 at 17:42 | answer | added | Ian Agol | timeline score: 4 | |
| Dec 13, 2010 at 12:57 | answer | added | Tony Huynh | timeline score: 12 | |
| Dec 13, 2010 at 9:00 | answer | added | Aaron Meyerowitz | timeline score: 5 | |
| Dec 13, 2010 at 8:31 | history | asked | Suresh Venkat | CC BY-SA 2.5 |