Large degree vertices in longest cycles of graphs, II

Binlong Li; Liming Xiong; Jun Yin

doi:10.5614/ejgta.2019.7.2.7

Large degree vertices in longest cycles of graphs, II

Binlong Li, Liming Xiong, Jun Yin

数学学院

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

2 引用（Scopus）

摘要

In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number s) has a longest cycle containing all vertices of degree at least d. We completely determine the d when k = 2. We propose a conjecture for those k-connected graph, where k 3.

源语言	英语
页（从-至）	277-299
页数	23
期刊	Electronic Journal of Graph Theory and Applications
卷	7
期	2
DOI	https://doi.org/10.5614/ejgta.2019.7.2.7
出版状态	已出版 - 2019

访问文件

10.5614/ejgta.2019.7.2.7

其它文件与链接

链接到 Scopus 的出版物

引用此

Li, B., Xiong, L., & Yin, J. (2019). Large degree vertices in longest cycles of graphs, II. Electronic Journal of Graph Theory and Applications, 7(2), 277-299. https://doi.org/10.5614/ejgta.2019.7.2.7

@article{a80d4608065546e9b017ac8c98fd02b5,

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

abstract = "In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number s) has a longest cycle containing all vertices of degree at least d. We completely determine the d when k = 2. We propose a conjecture for those k-connected graph, where k 3.",

keywords = "Connectivity, Independent number, large degree vertex Mathematics Subject Classification, Longest cycle",

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

note = "Publisher Copyright: {\textcopyright} 2019, Indonesian Combinatorics Society.",

year = "2019",

doi = "10.5614/ejgta.2019.7.2.7",

language = "English",

volume = "7",

pages = "277--299",

journal = "Electronic Journal of Graph Theory and Applications",

issn = "2338-2287",

publisher = "Indonesian Combinatorics Society",

number = "2",

}

TY - JOUR

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

AU - Li, Binlong

AU - Xiong, Liming

AU - Yin, Jun

PY - 2019

Y1 - 2019

N2 - In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number s) has a longest cycle containing all vertices of degree at least d. We completely determine the d when k = 2. We propose a conjecture for those k-connected graph, where k 3.

AB - In this paper, we consider the least integer d such that every k-connected graph G of order n (and of independent number s) has a longest cycle containing all vertices of degree at least d. We completely determine the d when k = 2. We propose a conjecture for those k-connected graph, where k 3.

KW - Connectivity

KW - Independent number, large degree vertex Mathematics Subject Classification

KW - Longest cycle

UR - http://www.scopus.com/inward/record.url?scp=85074724650&partnerID=8YFLogxK

U2 - 10.5614/ejgta.2019.7.2.7

DO - 10.5614/ejgta.2019.7.2.7

M3 - Article

AN - SCOPUS:85074724650

SN - 2338-2287

VL - 7

SP - 277

EP - 299

JO - Electronic Journal of Graph Theory and Applications

JF - Electronic Journal of Graph Theory and Applications

IS - 2

ER -

Large degree vertices in longest cycles of graphs, II

摘要

访问文件

其它文件与链接

指纹

引用此