Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/738| Title: | Notes on hamiltonian threshold and chain graphs | Authors: | Andelić, Milica Koledin, Tamara Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Algorithm;Binary sequence;Chain graph;Hamiltonian graph;Threshold graph | Issue Date: | 2021 | Rank: | M21 | Journal: | AIMS Mathematics | Abstract: | We revisit results obtained in [1], 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. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/738 | DOI: | 10.3934/math.2021300 |
| Appears in Collections: | Research outputs |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.