Abstract
We consider the Cayley graph of a Coxeter system and describe all maximal -cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to . As an application, we show that every automorphism of the half of Cayley graph is uniquely extendable to an automorphism of the Cayley graph if .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.