arXiv Analytics

Sign in

arXiv:1911.06261 [math.CO]AbstractReferencesReviewsResources

Flexibility and movability in Cayley graphs

Arindam Biswas

Published 2019-11-14Version 1

Let $\mathbf{\Gamma} = (V,E)$ be a (non-trivial) finite graph with $\lambda: E \rightarrow \mathbb{R}_{+}$, an edge labelling of $\mathbf{\Gamma}$. Let $\rho : V\rightarrow \mathbb{R}^{2}$ be a map which preserves the edge labelling. The graph $\mathbf{\Gamma}$ is said to be flexible if there exists an infinite number of such maps (upto equivalence by rigid transformations) and it is said to be movable if there exists an infinite number of injective maps. We study movability of Cayley graphs and construct regular moving graphs of all degrees. Further, we give explicit constructions of "dense", movable graphs.

Related articles: Most relevant | Search more
arXiv:2305.11623 [math.CO] (Published 2023-05-19)
Colorings of some Cayley graphs
arXiv:0711.3057 [math.CO] (Published 2007-11-20)
Cayley graphs formed by conjugate generating sets of S_n
arXiv:2209.00864 [math.CO] (Published 2022-09-02)
Maximality of subfields as cliques in Cayley graphs over finite fields