A Spanning Union of Cycles in Thin Cylinder, Torus and Klein Bottle Grid Graphs-Reference-Cited by-同舟云学术

A Spanning Union of Cycles in Thin Cylinder, Torus and Klein Bottle Grid Graphs

Published:2023-02-07 Issue:4 Volume:11 Page:846
ISSN:2227-7390
Container-title:Mathematics
language:en
Short-container-title:Mathematics

Author:

Đokić Jelena¹^ORCID,Doroslovački Ksenija¹^ORCID,Bodroža-Pantić Olga²^ORCID

Affiliation:

1. Faculty of Technical Sciences, University of Novi Sad, 21000 Novi Sad, Serbia

2. Department of Mathematics and Informatics, Faculty of Science, University of Novi Sad, 21000 Novi Sad, Serbia

Abstract

In this paper, we propose an algorithm for obtaining the common transfer digraph Dm* for enumeration of 2-factors in graphs from the title, all of which have m·n vertices (m,n∈N,m≥2). The numerical data gathered for m≤18 reveal some matches for the numbers of 2-factors for different types of torus or Klein bottle. In the latter case, we conjecture that these numbers are invariant under twisting.

Funder

Ministry of Science, Technological Development and Innovation of the Republic of Serbia

Department for Fundamental Disciplines in Technology of the Faculty of Technical Sciences at the University of Novi Sad

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Link

https://www.mdpi.com/2227-7390/11/4/846/pdf

Reference21 articles.

1. Transfer matrix method for enumeration and generation of compact self-avoiding walks. I. Square lattices;Kloczkowski;J. Chem. Phys.,1998

2. Exact enumeration of Hamiltonian circuits, walks and chains in two and three dimensions;Jacobsen;J. Phys. A Math. Theor.,2007

3. Enumeration of Labelled and Unlabelled Hamiltonian Cycles in Complete k-partite Graphs;Krasko;J. Math. Sci.,2021

4. On the Counting Complexity of Mathematical Nanosciences;Montoya;MATCH Commun. Math. Comput. Chem.,2021

5. Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs;Nishat;Graph-Theor. Concepts Comput. Sci.,2019

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The structure of the 2-factor transfer digraph common for thin cylinder, torus and Klein bottle grid graphs;FILOMAT;2024

2. Counting Traversing Hamiltonian Cycles in Tiled Graphs;Mathematics;2023-06-10