pith. sign in

arxiv: 1404.1479 · v2 · pith:PASF42QBnew · submitted 2014-04-05 · 🧮 math.CO · math.GR

On distance two in Cayley graphs of Coxeter groups

classification 🧮 math.CO math.GR
keywords cayleygraphautomorphismcoxeterdistancemaximalapplicationcliques
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.