arXiv Open Access 2016

On the Number of Cycles in a Graph

Bader F. AlBdaiwi

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DM

Penulis (1)

Bader F. AlBdaiwi

Format Sitasi

APA MLA BibTeX

AlBdaiwi, B.F. (2016). On the Number of Cycles in a Graph. https://arxiv.org/abs/1603.01807

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓