The maximum degree of a minimally hamiltonian-connected graph

Xingzhi Zhan

doi:10.1016/j.disc.2022.113159

The maximum degree of a minimally hamiltonian-connected graph

Xingzhi Zhan

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.

Original language	English
Article number	113159
Journal	Discrete Mathematics
Volume	345
Issue number	12
DOIs	https://doi.org/10.1016/j.disc.2022.113159
State	Published - Dec 2022

Keywords

Maximum degree
Minimally hamiltonian-connected
Minimum degree

Access to Document

10.1016/j.disc.2022.113159

Cite this

@article{09dbf5b773da48008fdbe7829332ab58,

title = "The maximum degree of a minimally hamiltonian-connected graph",

abstract = "We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.",

keywords = "Maximum degree, Minimally hamiltonian-connected, Minimum degree",

author = "Xingzhi Zhan",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",

year = "2022",

month = dec,

doi = "10.1016/j.disc.2022.113159",

language = "英语",

volume = "345",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "12",

}

TY - JOUR

T1 - The maximum degree of a minimally hamiltonian-connected graph

AU - Zhan, Xingzhi

PY - 2022/12

Y1 - 2022/12

N2 - We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.

AB - We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.

KW - Maximum degree

KW - Minimally hamiltonian-connected

KW - Minimum degree

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

U2 - 10.1016/j.disc.2022.113159

DO - 10.1016/j.disc.2022.113159

M3 - 文章

AN - SCOPUS:85137619717

SN - 0012-365X

VL - 345

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 12

M1 - 113159

ER -

The maximum degree of a minimally hamiltonian-connected graph

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this