59 research outputs found
Which finitely generated Abelian groups admit isomorphic Cayley graphs?
We show that Cayley graphs of finitely generated Abelian groups are rather
rigid. As a consequence we obtain that two finitely generated Abelian groups
admit isomorphic Cayley graphs if and only if they have the same rank and their
torsion parts have the same cardinality. The proof uses only elementary
arguments and is formulated in a geometric language.Comment: 16 pages; v2: added reference, reformulated quasi-convexity, v3:
small corrections; to appear in Geometriae Dedicat
Minimal chordal sense of direction and circulant graphs
A sense of direction is an edge labeling on graphs that follows a globally
consistent scheme and is known to considerably reduce the complexity of several
distributed problems. In this paper, we study a particular instance of sense of
direction, called a chordal sense of direction (CSD). In special, we identify
the class of k-regular graphs that admit a CSD with exactly k labels (a minimal
CSD). We prove that connected graphs in this class are Hamiltonian and that the
class is equivalent to that of circulant graphs, presenting an efficient
(polynomial-time) way of recognizing it when the graphs' degree k is fixed
On the complexity of acyclic modules in automata networks
Modules were introduced as an extension of Boolean automata networks. They
have inputs which are used in the computation said modules perform, and can be
used to wire modules with each other. In the present paper we extend this new
formalism and study the specific case of acyclic modules. These modules prove
to be well described in their limit behavior by functions called output
functions. We provide other results that offer an upper bound on the number of
attractors in an acyclic module when wired recursively into an automata
network, alongside a diversity of complexity results around the difficulty of
deciding the existence of cycles depending on the number of inputs and the size
of said cycle.Comment: 21 page
- …