A spanning union of cycles in thin cylinder, torus and Klein bottle grid graphs

2022/10/20 by Đokić, Jelena, Doroslovački, Ksenija, Bodroža-Pantić, Olga
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2210.11527

Abstract

We propose an algorithm for obtaining the common transfer digraph D^*_m for enumeration of 2-factors in graphs from the title all of which with m n vertices (m, n ∈ N, m >1 ). The numerical data gathered for m <19 reveal some matchings of the numbers of 2-factors for different types of torus or Klein bottle. In latter case we conjecture that these numbers are invariant under twisting.

Related

• The Structure of the 2-factor Transfer Digraph common for Thin Cylinder, Torus and Klein Bottle Grid Graphs
• A spanning union of cycles in rectangular grid graphs, thick grid cylinders and Moebius strips
• The Structure of the 2-factor Transfer Digraph Common for Rectangular, Thick Cylinder and Moebius Strip Grid Graphs
• Intersections of Cycling 2-factors
• A short note on the order of the double reduced 2-factor transfer digraph for rectangular grid graphs