Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
419696 | Discrete Applied Mathematics | 2013 | 7 Pages |
Abstract
We give an upper bound for the size of non-trivial sets that have small boundary in a family of arc-transitive digraphs. We state the exact size for these sets in case of prime degree. We also give a lower bound for the size of a minimum non-trivial cutset in the case of arc-transitive Cayley digraphs of prime degree.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
S.C. López,