A spanning union of cycles in rectangular grid graphs, thick grid cylinders and Moebius strips

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Dokic Jelena; Bodroza Pantic Olga; Doroslovacki Ksenija

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2024 | Volume:13 | Issue:1 Page(s): 41-66

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A spanning union of cycles in rectangular grid graphs, thick grid cylinders and Moebius strips

Author(s)

Dokic Jelena | Bodroza Pantic Olga | Doroslovacki Ksenija | Issue Writer Certificate

Keywords

Hamiltonian cycles

generating functions

transfer matrix method

2-factor

Abstract

Motivated to find the answers to some of the questions that have occurred in recent papers dealing with Hamiltonian cycles (abbreviated HCs) in some special classes of grid graphs we started the investigation of spanning unions of cycles, the so-called 2-factors, in these graphs (as a generalizations of HCs). For all the three types of graphs from the title and for any integer $m \geq 2$ we propose an algorithm for obtaining a specially designed (transfer) digraph ${\cal D}^*_m$. The problem of enumeration of 2-factors is reduced to the problem of enumerating oriented walks in this digraph. Computational results we gathered for $m \leq 17$ reveal some interesting properties both for the digraphs ${\cal D}^*_m$ and for the sequences of numbers of 2-factors.We prove some of them for arbitrary $m \geq 2$.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans