Timeline for Blinking graphs
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 17, 2021 at 1:28 | history | edited | Tony Huynh |
edited tags
|
|
| Feb 11, 2016 at 1:34 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
added 263 characters in body
|
| Feb 9, 2016 at 10:52 | vote | accept | Joseph O'Rourke | ||
| Feb 8, 2016 at 21:21 | comment | added | Algernon | Just a rather obvious remark, a blinking assignment can also be identified by a partitioning of the vertex set into two parts $A$ and $B$ such that each vertex in $A$ has even number of neighbours in $A$ and odd number of neighbours in $B$, and similarly, each vertex in $B$ has even number of neighbours in $B$ and odd number of neighbours in $A$. | |
| Feb 8, 2016 at 21:21 | answer | added | Tony Huynh | timeline score: 8 | |
| Feb 8, 2016 at 21:18 | answer | added | Gregory J. Puleo | timeline score: 12 | |
| Feb 8, 2016 at 21:05 | comment | added | Algernon | On a regular lattice, this is sometimes called the XOR cellular automaton. It forms characteristic fractals (Sierpinski triangle on $\mathbb{Z}$) in its space-time trajectories. | |
| Feb 8, 2016 at 20:34 | history | asked | Joseph O'Rourke | CC BY-SA 3.0 |