The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order

Pu Qiao; Xingzhi Zhan

doi:10.1002/jgt.22483

The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order

Pu Qiao
, Xingzhi Zhan^*

^*此作品的通讯作者

数学科学学院

East China University of Science and Technology

科研成果: 期刊稿件 › 文章 › 同行评审

2 引用（Scopus）

摘要

We prove that the minimum number of Hamilton cycles in a Hamiltonian threshold graph of order (Formula presented.) is (Formula presented.) and this minimum number is attained uniquely by the graph with degree sequence (Formula presented.) of (Formula presented.) distinct degrees. This graph is also the unique graph of minimum size among all Hamiltonian threshold graphs of order (Formula presented.).

源语言	英语
页（从-至）	222-229
页数	8
期刊	Journal of Graph Theory
卷	93
期	2
DOI	https://doi.org/10.1002/jgt.22483
出版状态	已出版 - 1 2月 2020

访问文件

10.1002/jgt.22483

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{ddf3f6c025be4f83aad24c5b86356a01,

title = "The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order",

abstract = "We prove that the minimum number of Hamilton cycles in a Hamiltonian threshold graph of order (Formula presented.) is (Formula presented.) and this minimum number is attained uniquely by the graph with degree sequence (Formula presented.) of (Formula presented.) distinct degrees. This graph is also the unique graph of minimum size among all Hamiltonian threshold graphs of order (Formula presented.).",

keywords = "Hamiltonian graph, minimum size, number of Hamilton cycles, threshold graph",

author = "Pu Qiao and Xingzhi Zhan",

note = "Publisher Copyright: {\textcopyright} 2019 Wiley Periodicals, Inc.",

year = "2020",

month = feb,

day = "1",

doi = "10.1002/jgt.22483",

language = "英语",

volume = "93",

pages = "222--229",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "2",

}

TY - JOUR

T1 - The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order

AU - Qiao, Pu

AU - Zhan, Xingzhi

PY - 2020/2/1

Y1 - 2020/2/1

N2 - We prove that the minimum number of Hamilton cycles in a Hamiltonian threshold graph of order (Formula presented.) is (Formula presented.) and this minimum number is attained uniquely by the graph with degree sequence (Formula presented.) of (Formula presented.) distinct degrees. This graph is also the unique graph of minimum size among all Hamiltonian threshold graphs of order (Formula presented.).

AB - We prove that the minimum number of Hamilton cycles in a Hamiltonian threshold graph of order (Formula presented.) is (Formula presented.) and this minimum number is attained uniquely by the graph with degree sequence (Formula presented.) of (Formula presented.) distinct degrees. This graph is also the unique graph of minimum size among all Hamiltonian threshold graphs of order (Formula presented.).

KW - Hamiltonian graph

KW - minimum size

KW - number of Hamilton cycles

KW - threshold graph

UR - https://www.scopus.com/pages/publications/85070830339

U2 - 10.1002/jgt.22483

DO - 10.1002/jgt.22483

M3 - 文章

AN - SCOPUS:85070830339

SN - 0364-9024

VL - 93

SP - 222

EP - 229

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 2

ER -

The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order

摘要

访问文件

其它文件与链接

指纹

引用此