Timeline for Characteristic polynomial of hypercube graph
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2012 at 2:23 | comment | added | Richard Stanley | A related remark: since $H_n$ is regular, an explicit formula for the number of trees follows from knowing the eigenvalues of the adjacency matrix. It was an open problem to find a combinatorial proof of this formula. Such a proof was recently given by Olivier Bernardi, front.math.ucdavis.edu/1207.0896. | |
| Nov 10, 2012 at 23:33 | vote | accept | Feldmann Denis | ||
| Nov 10, 2012 at 22:48 | comment | added | Chris Godsil | My comment to this was a bit too long, so I've added it to my answer. | |
| Nov 10, 2012 at 22:47 | history | edited | Chris Godsil | CC BY-SA 3.0 |
responded to comment
|
| Nov 10, 2012 at 22:41 | history | edited | Chris Godsil | CC BY-SA 3.0 |
added comment re multiplicitiies
|
| Nov 10, 2012 at 22:34 | comment | added | Feldmann Denis | Well, actually, I am looking for things like calculations of the characteristic polynomial by manipulations of the graph (addig edges or vertices, product of graphes, ans so on), and trying to get some intuition by using well-known families of graphs. But I may be completely on the wrong track | |
| Nov 10, 2012 at 22:28 | history | answered | Chris Godsil | CC BY-SA 3.0 |