On the number of cycles in a graph

Year, pages: 2018, 1 - 10

There is a sizable literature on investigating the minimum and maximum numbers of cycles in a class of graphs. However, the answer is known only for special classes. This paper presents a result on the smallest number of cycles in Hamiltonian 3-connected cubic graphs. Further, it describes a proof technique that could improve an upper bound of the largest number of cycles in a Hamiltonian graph.

Albdaiwi, B. 2018. On the number of cycles in a graph. In Mathematica Slovaca, vol. 68, no.1, pp. 1-10. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0074

Albdaiwi, B. (2018). On the number of cycles in a graph. Mathematica Slovaca, 68(1), 1-10. 0139-9918. DOI: https://doi.org/10.1515/ms-2017-0074