Notes on the connectivity of Cayley coset digraphs
classification
🧮 math.CO
keywords
cayleydigraphscosetvertexconnectedconnectivitycycle-prefixgraphs
pith:Q2VFSOHA Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{Q2VFSOHA}
Prints a linked pith:Q2VFSOHA badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
Hamidoune's connectivity results for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayley coset digraph can be hierarchically decomposed in a certain way, then it is optimally vertex connected. The results are obtained by extending the methods used by Hamidoune. They are used to show that cycle-prefix graphs are optimally vertex connected. This implies that cycle-prefix graphs have good fault tolerance properties.
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.