Timeline for Why is the number of Hamiltonian Cycles of n-octahedron equivalent to the number of Perfect Matching in specific family of Graphs?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2018 at 15:16 | vote | accept | Mario Krenn | ||
| Jun 13, 2018 at 10:23 | history | edited | IJL | CC BY-SA 4.0 |
added 1089 characters in body
|
| Jun 13, 2018 at 9:51 | comment | added | Mario Krenn | thank you for your insights about the complement graphs. I still don't understand why these numbers should be the same. I understand that the complement of octahedron-graph gives one perfect matching, and the complementary of the ($K_{2n}-C_{2n}$), so the $C_{2n}$ gives one Hamiltonian cycle. But i do not understand why, for example, the n=3-dimensional octahedron graph has 4 Hamilton cycles, while the $K_{6}-C_{6}$ graph has 4 perfect matchings. Could you please explain your intuitions a bit more, or refere to some relevant literature? thank you! | |
| Jun 12, 2018 at 16:21 | history | answered | IJL | CC BY-SA 4.0 |