Timeline for Classes of graphs for which isospectrum implies isomorphism?
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 6, 2011 at 21:27 | vote | accept | Suresh Venkat | ||
| Dec 13, 2010 at 23:09 | comment | added | Suresh Venkat | that's a nice reference. and yes, I meant the first version, but both are interesting. | |
| Dec 13, 2010 at 11:54 | comment | added | Gordon Royle | I'm not sure maximum degree two or complete count as "interesting" classes of graphs, do they :-) | |
| Dec 13, 2010 at 9:39 | comment | added | Aaron Meyerowitz | Correct (if I have not made an error) See win.tue.nl/~aeb/2WF02/easyspectra.pdf for the details. Most trees are not determined by their spectra but some people think that most graphs are. | |
| Dec 13, 2010 at 9:35 | history | edited | Aaron Meyerowitz | CC BY-SA 2.5 |
added 341 characters in body
|
| Dec 13, 2010 at 9:25 | history | edited | Aaron Meyerowitz | CC BY-SA 2.5 |
exanded answer
|
| Dec 13, 2010 at 9:03 | comment | added | Suresh Venkat | I think I see why (at least for regular of degree 2), but is it obvious and I'm missing something ? the class of graphs you're describing are disjoint collections of cycles and paths, and so I presume the argument is that each component then sets off a distinct spectral signature ? | |
| Dec 13, 2010 at 9:00 | history | answered | Aaron Meyerowitz | CC BY-SA 2.5 |