

In this paper, we prove that all but one of the components of the transfer digraph D*m needed for the enumeration of 2-factors in the rectangular, thick cylinder and Moebius strip grid graphs of the fixed width m (m ∈ N) are bipartite digraphs and that their orders could be expressed in term of binomial coefficients. In addition, we prove that the set of vertices of each component consists of all the binary m-words for which the difference of numbers of zeros in odd and even positions is constant © 2023, Applicable Analysis and Discrete Mathematics.All Rights Reserved.
| Funding sponsor | Funding number | Acronym |
|---|---|---|
| 451-03-9/2022-14/200125,451-03-68/2022-14/200156,200125 |
The authors are indebted to the anonymous referees for their valuable suggestions and helpful comments which improved the clarity of the presentation. The authors would like to express their gratitude to Roddy Bogawa for his meticulous reading of the first draft of the manuscript and on many useful suggestions. This work was supported by the Ministry of Science, Technological Development and Innovation of the Republic of Serbia (Grants No. 451-03-9/2022-14/200125, 451-03-68/2022-14/200156) and the Project of the Department for fundamental disciplines in technology, Faculty of Technical Sciences, University of Novi Sad \u201DApplication of general disciplines in technical and IT sciences\u201D
This work was supported by the Ministry of Science, Technological Development and Innovation of the Republic of Serbia (Grants No. 451-03-9/2022-14/200125, 451-03-68/2022-14/200156) and the Project of the Department for fundamental disciplines in technology, Faculty of Technical Sciences, University of Novi Sad \u201DApplication of general disciplines in technical and IT sciences\u201D.
Doroslovački, K.; Faculty of Technical Sciences, University of Novi Sad, Novi Sad, Serbia;
© Copyright 2023 Elsevier B.V., All rights reserved.