Small cutsets in arc-transitive digraphs of prime degree
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 digrap...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2013 |
| País: | España |
| Institución: | Universitat de Lleida (UdL) |
| Repositorio: | Repositori Obert UdL |
| OAI Identifier: | oai:repositori.udl.cat:10459.1/66454 |
| Acceso en línea: | https://doi.org/10.1016/j.dam.2013.02.005 http://hdl.handle.net/10459.1/66454 |
| Access Level: | acceso abierto |
| Palabra clave: | Arc-transitive Cayley digraph 2-atom Vosperian |
| Sumario: | 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. |
|---|