Papers › Game of Life on Graphs
Game of Life on Graphs
Mikhail Krechetov
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We consider a specific graph dynamical system inspired by the famous Conway's Game of Life in this work. We study the properties of the dynamical system on different graphs and introduce a new efficient heuristic for graph isomorphism testing. We use the evolution of our system to extract features from a graph in a deterministic way and observe that the extracted features are unique and the distance induced by that features satisfy triangle inequality for all connected graphs with up to ten vertices.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections