The separated box product of two digraphs
From MaRDI portal
Publication:518172
DOI10.1016/j.ejc.2016.11.007zbMath1358.05240arXiv1511.00623MaRDI QIDQ518172
Primož Potočnik, Stephen E. Wilson
Publication date: 28 March 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.00623
05C20: Directed graphs (digraphs), tournaments
05C76: Graph operations (line graphs, products, etc.)
Related Items
Recipes for edge-transitive tetravalent graphs, Four-valent oriented graphs of biquasiprimitive type
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linking rings structures and semisymmetric graphs: Cayley constructions
- Tetravalent edge-transitive graphs of girth at most 4
- Finite edge-transitive oriented graphs of valency four: a global approach
- Reachability relations in digraphs
- A classification of tightly attached half-arc-transitive graphs of valency 4
- A characterization of particular symmetric (0,1) matrices
- Half-transitive group actions on finite graphs of valency 4
- Bridging semisymmetric and half-arc-transitive actions on graphs
- Cubic vertex-transitive graphs on up to 1280 vertices
- Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
- Unexpected symmetries in unstable graphs
- Stability of arc-transitive graphs
- Linking rings structures and tetravalent semisymmetric graphs
- Four Constructions of Highly Symmetric Tetravalent Graphs
- Reachability relations, transitive digraphs and groups
- A census of 4-valent half-arc-transitive graphs and arc-transitive digraphs of valence two
- Some recent discoveries about half-arc-transitive graphs
- Regular line-symmetric graphs
- Vertex and Edge Transitive, but not 1-Transitive, Graphs
- Half-arc-transitive graphs of arbitrary even valency greater than 2
