Flexibility and movability in Cayley graphs
Abstract
Let = (V,E) be a (non-trivial) finite graph with λ: E → R+, an edge labelling of . Let : V→ R2 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.