Reachability relations in digraphs

DOI10.1016/j.ejc.2007.11.003zbMath1152.05032OpenAlexW2093229750MaRDI QIDQ942126

Primož Šparl, Aleksander Malnič, Dragan Marušič, Norbert Seifter, Boris Zgrablić

Publication date: 4 September 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.003

zbMATH Keywords

reachabilityequivalence relationtransitive digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Descendant-homogeneous digraphs ⋮ On tetravalent half-arc-transitive graphs of girth 5 ⋮ Half-arc-transitive group actions with a small number of alternets ⋮ The separated box product of two digraphs ⋮ An infinite family of half-arc-transitive graphs with universal reachability relation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
• Highly arc transitive digraphs: reachability, topological groups
• Reachability relations and the structure of transitive digraphs
• A note on the growth of transitive graphs
• Infinite highly arc transitive digraphs and universal covering digraphs
• An infinite highly arc-transitive digraph
• Lifting graph automorphisms by voltage assignments
• Descendants in highly arc transitive digraphs
• Bridging semisymmetric and half-arc-transitive actions on graphs
• Highly arc-transitive digraphs with no homomorphism onto \(\mathbb Z\)
• Über unendliche Wege in Graphen
• On geometric properties of directed vertex-symmetric graphs
• Random Walks on Infinite Graphs and Groups
• A conjecture concerning a limit of non-Cayley graphs

This page was built for publication: Reachability relations in digraphs