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

School of Mathematics and Statistics

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

2 Citations (Scopus)

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.

Original language	English
Pages (from-to)	277-299
Number of pages	23
Journal	Electronic Journal of Graph Theory and Applications
Volume	7
Issue number	2
DOIs	https://doi.org/10.5614/ejgta.2019.7.2.7
Publication status	Published - 2019

Keywords

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

Access to Document

10.5614/ejgta.2019.7.2.7

Cite this

@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 - https://www.scopus.com/pages/publications/85074724650

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this