A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphsArticle
Authors: Olga Bodroža-Pantić 1; Harris Kwong 2; Milan Pantić 3
0000-0002-7206-4009##NULL##NULL
Olga Bodroža-Pantić;Harris Kwong;Milan Pantić
1 Department of Mathematics and Informatics [Novi Sad]
2 Mathematical Sciences Department [Fredonia, NY]
3 Department of Physics [Novi Sad]
We study the enumeration of Hamiltonian cycles on the thin grid cylinder graph Cm×Pn+1. We distinguish two types of Hamiltonian cycles, and denote their numbers hAm(n) and hBm(n). For fixed m, both of them satisfy linear homogeneous recurrence relations with constant coefficients, and we derive their generating functions and other related results for m≤10. The computational data we gathered suggests that hAm(n)∼hBm(n) when m is even.
The influence of elementary excitations and conformations to physical properties of the new materials based on strongly correlated low-dimensional systems; Funder: Ministry of Education, Science and Technological Development of Republic of Serbia; Code: 171009
Algebraic, logical and combinatorial methods with applications in theoretical computer science; Funder: Ministry of Education, Science and Technological Development of Republic of Serbia; Code: 174018
New products based on cereals and pseudocereals from organic production; Funder: Ministry of Education, Science and Technological Development of Republic of Serbia; Code: 46005
Bibliographic References
1 Document citing this article
Olga Bodroza-Pantic;Harris Kwong;Jelena Djokic;Rade Doroslovacki;Milan Pantic, 2021, Enumeration of Hamiltonian cycles on a thick grid cylinder - Part II: Contractible Hamiltonian cycles, Applicable Analysis and Discrete Mathematics, 16, 1, pp. 246-287, 10.2298/aadm200629027b, https://doi.org/10.2298/aadm200629027b.