Properties of sub-add move graphs
Abstract
We introduce the notion of a move graph, that is, a directed graph whose vertex set is a \(\mathbb Z\)-module \(\mathbb Z_n^m\), and whose arc set is uniquely determined by the action \(M\!:\!\mathbb Z_n^m\to \mathbb Z_n^m\) where \(M\) is an \(m\times m\) matrix with integer entries. We study the manner in which properties of move graphs differ when one varies the choice of cyclic group \(\mathbb Z_n\). Our principal focus is on a special family of such graphs, which we refer to as “sub-add move graphs.”
Fields of Study & Subjects
Advanced Graph Theory Research
Cellular Automata and Applications
graph theory and CDMA systems
Publication details
- Journal / source
- Congressus Numerantium
- Volume
- 237
- Pages
- 169–184
- Publication date
- 30 June 2026
- Language
- EN