Flexibility and movability in Cayley graphs
Combinatorics
2019-11-15 v1
Abstract
Let be a (non-trivial) finite graph with , an edge labelling of . Let be a map which preserves the edge labelling. The graph 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.
Cite
@article{arxiv.1911.06261,
title = {Flexibility and movability in Cayley graphs},
author = {Arindam Biswas},
journal= {arXiv preprint arXiv:1911.06261},
year = {2019}
}