Timeline for Graphs with many positive eigenvalues of their distance matrix
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 1, 2013 at 15:27 | comment | added | Chris Godsil | Joro; I misunderstood your comment, I realize now. | |
| Oct 1, 2013 at 14:59 | history | edited | Jernej | CC BY-SA 3.0 |
added 328 characters in body
|
| Oct 1, 2013 at 14:47 | comment | added | joro | @ChrisGodsil I used exactly nauty's geng. | |
| Oct 1, 2013 at 14:39 | comment | added | Chris Godsil | joro: use McKay's geng to get regular graphs on 12 vertices. | |
| Oct 1, 2013 at 14:14 | comment | added | Jernej | @survit $d(x,y)$ is the length of the shortest x-y path. | |
| Oct 1, 2013 at 14:09 | comment | added | joro | Couldn't find regular graph on 12 vertices for a start. | |
| Oct 1, 2013 at 13:28 | comment | added | Suvrit | as a followup: what is "d(x,y)"? An arbitrary metric, or is the vertex set embedded into Euclidean space? or is it the shortest path length from $x$ to $y$? | |
| Oct 1, 2013 at 13:13 | history | edited | Jernej | CC BY-SA 3.0 |
added 151 characters in body
|
| Oct 1, 2013 at 13:11 | comment | added | Suvrit | could you please include a definition of this "distance matrix" --- I'm familiar with a few notions but am not sure which one is meant here. Thanks! | |
| Oct 1, 2013 at 12:37 | history | asked | Jernej | CC BY-SA 3.0 |