On distance two in Cayley graphs of Coxeter groups

preprint2014arXivOpen access

Abstract

We consider the Cayley graph C(W,S){\rm C}(W,S) of a Coxeter system (W,S)(W,S) and describe all maximal 22-cliques in this graph, i.e. maximal subsets in the vertex set such that the distance between any two distinct elements is equal to 22. 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 ∣S∣≥5|S|\ge 5.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.