Base Graph -- Connection Graph: Dissection and Construction

DOI10.1016/J.DAM.2020.10.028MaRDI QIDQ6338064arXivFDO

Authors Primož Potočnik, Gabriel Verret, Steve Wilson

Publication date 4 April 2020

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DAM.2020.10.028

Mathematics Subject Classification ID

Group actions on combinatorial structures (05E18)

arXiv classification

math.CO

Abstract: This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence 2 so that the connected components of the result are isomorphic. Given the Base Graph whose subdivision is isomorphic to each component, and the Connection Graph, which describes how the components overlap, we can, in some cases, provide a construction which can make a graph having such a decomposition. This paper investigates the general phenomenon as well as the special cases in which the connection graph has no more than one edge.

This page was built for publication: Base Graph -- Connection Graph: Dissection and Construction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6338064)