polygonal bigraph

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges (v_k, v_(2k + 1)) and (v_(k + 1), v_(2k)) for k = 1, 3, ..., (n - 1). The crossed prism graphs are cubic vertex-transitive (and hence appear in Read and Wilson 1998, though without any designation indicating membership in a special graph family), weakly regular, Hamiltonian, and Hamilton-laceable. The 2n-crossed prism graphs are toroidal for n>2 (E. Weisstein, May 9, 2023). Simmons used the term "polygonal bigraph on 4m vertices" for graphs isomorphic to the m-crossed prism graph and investigated the Hamilton-laceability and structure of Hamiltonian paths in these graphs.

cubical graph | cubic vertex-transitive graph | cycle graph | Franklin graph | helm graph | honeycomb toroidal graph | ladder graph | Möbius ladder | prism graph | web graph