Loading...
Loading...

Go to the content (press return)

On vosperian and superconnected vertex-transitive digraphs

Author
López, S.C.; Hamidoune, Y.O.; Llado, A.
Type of activity
Presentation of work at congresses
Name of edition
22nd British Combinatorial Conference
Date of publication
2009
Presentation's date
2009-07
Book of congress proceedings
Abstracts of the 22nd British Combinatorial Conference
First page
21
Last page
21
DOI
https://doi.org/10.1007/s00373-011-1104-4 Open in new window
URL
http://bcc2009.mcs.st-and.ac.uk/docs/bccpbook/pbook.pdf Open in new window
Abstract
Weinvestigatethestructureofadigraphhavingatransitiveautomorphism group where every cutset of minimal cardinality consists of all successors or all predecessors of some vertex. We give a complete characterization of vosperian arc-transitive digraphs. It states that an arc-transitive strongly connected digraph is vosperian if and only if it is irreducible. In particular, this is the case if the degree is coprime with the order of the digraph. We give also a complete characterization of vosperian C...
Keywords
Arc-transitive. Cayley digraph. Isoperimetric connectivity. · Superconnected. Vosperian.
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants

  • López Masip, Susana Clara  (author and speaker )
  • Hamidoune, Yayha Old  (author and speaker )
  • Llado Sanchez, Anna  (author and speaker )