Notes on the connectivity of Cayley coset digraphs

Details Notes on the connectivity of Cayley coset digraphs Notes on the connectivity of Cayley coset digraphs

1994-11-10

arxiv.org/abs/math/9411221v1

Mathematics

Combinatorics

15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Notes on the connectivity of Cayley coset digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Notes on the connectivity of Cayley coset digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Notes on the connectivity of Cayley coset digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-683564