论文标题
关于哈密顿阈值和链图的注释
Notes on Hamiltonian threshold and chain graphs
论文作者
论文摘要
我们重新访问[F. Harary，U。Peled，Hamiltonian阈值图，离散应用。我们以新形式介绍了这些结果，现在根据结构参数唯一定义阈值图，并将其扩展到链图。我们还标识了给定秩序的汉密尔顿链图中汉密尔顿周期数量最少的链图。
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.
