Subdivided double
In graph theory, the subdivided double is a construction used to transform a 4-regular graph into a larger 4-regular graph. It consists of two steps: subdividing every edge into a path of two edges (with a new vertex in the middle of each path), and then replacing every vertex of the original graph with two copies, both adjacent to the same subdivision vertices.[1][2] Potočnik, Verret, and Wilson use the notation to denote the subdivided double of a graph .[3] It was named as the subdivided double earlier, by Potočnik and Wilson.[1]
An example of a subdivided double is the Folkman graph, a ten-vertex graph that can be constructed from the five-vertex complete graph as its subdivided double .[2]
Every subdivided double is a bipartite graph, with the subdivision vertices on one side of its bipartition and the doubled vertices on the other side.[1] When the starting graph is an arc-transitive graph (having symmetries mapping any two oriented edges to each other), the subdivided double is an edge-transitive graph: the subdivided double has symmetries that map any two edges to each other. However, it may not be arc-transitive or vertex-transitive: there may be no symmetry that swaps the two sides of the bipartition. For this reason, the subdivided double construction has been studied as a way of generating semi-symmetric graphs, bipartite graphs that are edge-transitive but not vertex-transitive.[1][2] Every subdivided double has exponentially many Hamiltonian cycles, and in a subdivided double every Hamiltonian cycle is complementary to another Hamiltonian cycle, forming a Hamiltonian decomposition.[4]
Whenever a 4-regular semi-symmetric graph contains two twin vertices, vertices that have the same sets of neighbors as each other, it can be constructed as a subdivided double.[1][2]
References
- ↑ 1.0 1.1 1.2 1.3 1.4 Potočnik, Primož; Wilson, Stephen E. (2007), "Tetravalent edge-transitive graphs of girth at most 4", Journal of Combinatorial Theory, Series B 97 (2): 217–236, doi:10.1016/j.jctb.2006.03.007
- ↑ 2.0 2.1 2.2 2.3 Potočnik, Primož; Wilson, Stephen E. (2014), "Linking rings structures and tetravalent semisymmetric graphs", Ars Mathematica Contemporanea 7 (2): 341–352, doi:10.26493/1855-3974.311.4a8
- ↑ Potočnik, Primož; Verret, Gabriel; Wilson, Stephen (2021), "Base graph-connection graph: dissection and construction", Discrete Applied Mathematics 291: 116–128, doi:10.1016/j.dam.2020.10.028
- ↑ "Hamiltonian cycles in subdivided doubles", Ars Mathematica Contemporanea 26 (4): 1–9, August 2026, doi:10.26493/1855-3974.3557.f2d
