Large degree vertices in longest cycles of graphs, I

Binlong Li; Liming Xiong; Jun Yin

doi:10.7151/dmgt.1861

Large degree vertices in longest cycles of graphs, I

Binlong Li
, Liming Xiong
, Jun Yin

School of Mathematics and Statistics

Northwestern Polytechnical University Xian
University of West Bohemia
Beijing Institute of Technology
Qinghai Normal University

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

4 Citations (Scopus)

Abstract

In this paper, we consider the least integer d such that every longest cycle of a κ-connected graph of order n (and of independent number α) contains all vertices of degree at least d.

Original language	English
Pages (from-to)	363-382
Number of pages	20
Journal	Discussiones Mathematicae - Graph Theory
Volume	36
Issue number	2
DOIs	https://doi.org/10.7151/dmgt.1861
Publication status	Published - 2016

Keywords

Connectivity
Independent number
Large degree vertices
Longest cycle
Order

Access to Document

10.7151/dmgt.1861

Cite this

@article{53f9034254eb40c6930b8df268b6cf82,

title = "Large degree vertices in longest cycles of graphs, I",

abstract = "In this paper, we consider the least integer d such that every longest cycle of a κ-connected graph of order n (and of independent number α) contains all vertices of degree at least d.",

keywords = "Connectivity, Independent number, Large degree vertices, Longest cycle, Order",

author = "Binlong Li and Liming Xiong and Jun Yin",

year = "2016",

doi = "10.7151/dmgt.1861",

language = "English",

volume = "36",

pages = "363--382",

journal = "Discussiones Mathematicae - Graph Theory",

issn = "1234-3099",

publisher = "University of Zielona Gora",

number = "2",

}

TY - JOUR

T1 - Large degree vertices in longest cycles of graphs, I

AU - Li, Binlong

AU - Xiong, Liming

AU - Yin, Jun

PY - 2016

Y1 - 2016

N2 - In this paper, we consider the least integer d such that every longest cycle of a κ-connected graph of order n (and of independent number α) contains all vertices of degree at least d.

AB - In this paper, we consider the least integer d such that every longest cycle of a κ-connected graph of order n (and of independent number α) contains all vertices of degree at least d.

KW - Connectivity

KW - Independent number

KW - Large degree vertices

KW - Longest cycle

KW - Order

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

U2 - 10.7151/dmgt.1861

DO - 10.7151/dmgt.1861

M3 - Article

AN - SCOPUS:84962828798

SN - 1234-3099

VL - 36

SP - 363

EP - 382

JO - Discussiones Mathematicae - Graph Theory

JF - Discussiones Mathematicae - Graph Theory

IS - 2

ER -

Large degree vertices in longest cycles of graphs, I

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this