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 documento: | artigo |
| Estado: | Versión aceptada para publicación |
| Data de publicação: | 2013 |
| País: | España |
| Recursos: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositório: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10459.1/66454 |
| Acesso em linha: | https://doi.org/10.1016/j.dam.2013.02.005 http://hdl.handle.net/10459.1/66454 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Arc-transitive Cayley digraph 2-atom Vosperian |
| Resumo: | 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. |
|---|