A note on the 2-power of Hamilton cycles

Zia Ullah Khan; Long Tu Yuan

doi:10.1016/j.disc.2022.112908

A note on the 2-power of Hamilton cycles

Zia Ullah Khan
, Long Tu Yuan^*

^*Corresponding author for this work

School of Mathematical Sciences

Shanghai Jiao Tong University

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

4 Scopus citations

Abstract

We determine the maximum number of edges of a graph without containing the 2-power of a Hamilton cycle. This extends a well-known theorem of Ore in 1961 concerning the maximum number of edges of a graph without containing a Hamilton cycle.

Original language	English
Article number	112908
Journal	Discrete Mathematics
Volume	345
Issue number	8
DOIs	https://doi.org/10.1016/j.disc.2022.112908
State	Published - Aug 2022

Keywords

2-power of graphs
Hamilton cycle

Access to Document

10.1016/j.disc.2022.112908

Cite this

@article{8f7a71c353294fb18f4e26ccfb6b1d2f,

title = "A note on the 2-power of Hamilton cycles",

abstract = "We determine the maximum number of edges of a graph without containing the 2-power of a Hamilton cycle. This extends a well-known theorem of Ore in 1961 concerning the maximum number of edges of a graph without containing a Hamilton cycle.",

keywords = "2-power of graphs, Hamilton cycle",

author = "Khan, \{Zia Ullah\} and Yuan, \{Long Tu\}",

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

year = "2022",

month = aug,

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

language = "英语",

volume = "345",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "8",

}

TY - JOUR

T1 - A note on the 2-power of Hamilton cycles

AU - Khan, Zia Ullah

AU - Yuan, Long Tu

PY - 2022/8

Y1 - 2022/8

N2 - We determine the maximum number of edges of a graph without containing the 2-power of a Hamilton cycle. This extends a well-known theorem of Ore in 1961 concerning the maximum number of edges of a graph without containing a Hamilton cycle.

AB - We determine the maximum number of edges of a graph without containing the 2-power of a Hamilton cycle. This extends a well-known theorem of Ore in 1961 concerning the maximum number of edges of a graph without containing a Hamilton cycle.

KW - 2-power of graphs

KW - Hamilton cycle

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

U2 - 10.1016/j.disc.2022.112908

DO - 10.1016/j.disc.2022.112908

M3 - 文章

AN - SCOPUS:85126976458

SN - 0012-365X

VL - 345

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 8

M1 - 112908

ER -

A note on the 2-power of Hamilton cycles

Abstract

Keywords

Access to Document

Other files and links

Cite this