Base graph-connection graph: dissection and construction

DOI10.1016/j.dam.2020.10.028OpenAlexW3117492027MaRDI QIDQ2659066

Gabriel Verret, Primož Potočnik, Stephen E. Wilson

Publication date: 25 March 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.02030

zbMATH Keywords

graphedge-transitivetetravalentarc-transitivesemisymmetric4-valentlocally dart-transitive

Mathematics Subject Classification ID

Graph theory (05Cxx) Algebraic combinatorics (05Exx) Permutation groups (20Bxx)

Cites Work

• Unnamed Item
• Locally 3-arc-transitive regular covers of complete bipartite graphs
• Tetravalent edge-transitive graphs of girth at most 4
• A characterization of a class of symmetric graphs of twice prime valency
• On certain edge-transitive bicirculants
• Bounding the order of the vertex-stabiliser in 3-valent vertex-transitive and 4-valent arc-transitive graphs
• On locally \(s\)-arc transitive graphs that are not of local characteristic \(p\)
• An application of the Local C(G,T) Theorem to a conjecture of Weiss
• Rose window graphs
• Analysing finite locally 𝑠-arc transitive graphs
• Recipes for edge-transitive tetravalent graphs
• Bipartite edge-transitive bi-p-metacirculants

This page was built for publication: Base graph-connection graph: dissection and construction