On distance two in Cayley graphs of Coxeter groups

2014/04/05 by Mark Pankov, Pankov, Mark
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Group Theory (math.GR) #math.CO #math.GR

paper · pdf · doi:10.48550/arxiv.1404.1479

arxiv created 2014/04/28 · arxiv updated 2014/04/29

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|≥ 5.

Related

• Distance-regular Cayley graphs over ℤ_p^s⊕ℤ_p
• Distance-regular Cayley graphs over dicyclic groups
• A classification of two-distance-transitive Cayley graphs over the generalized quaternion groups
• Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
• Classification of two-distance-transitive Cayley graphs of the semi-dihedral groups