Notes on Hamiltonian threshold and chain graphs
Combinatorics
2021-02-17 v2
Abstract
We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient conditions for a connected threshold graph to be Hamiltonian were obtained. We present these results in new forms, now stated in terms of structural parameters that uniquely define the threshold graph and we extend them to chain graphs. We also identify the chain graph with minimum number of Hamilton cycles within the class of Hamiltonian chain graphs of a given order.
Keywords
Cite
@article{arxiv.2005.09566,
title = {Notes on Hamiltonian threshold and chain graphs},
author = {Milica Andelic and Tamara Koledin and Zoran Stanic},
journal= {arXiv preprint arXiv:2005.09566},
year = {2021}
}
Comments
9 pages, 1 figure