Cycles through prescribed vertices with large degree sum

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σk + 1(S; G). We obtain a sharp lower bound of σk + 1(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.

Original languageEnglish
Pages (from-to)201-210
Number of pages10
JournalDiscrete Mathematics
Volume145
Issue number1-3
DOIs
Publication statusPublished - 1995 Oct 13

Fingerprint

Degree Sum
Hamiltonians
Connected graph
Cycle
Lower bound
Denote
Sufficient Conditions

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Cycles through prescribed vertices with large degree sum. / Ota, Katsuhiro.

In: Discrete Mathematics, Vol. 145, No. 1-3, 13.10.1995, p. 201-210.

Research output: Contribution to journalArticle

@article{6eac687c05434da3acab24d7395a0261,
title = "Cycles through prescribed vertices with large degree sum",
abstract = "Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σk + 1(S; G). We obtain a sharp lower bound of σk + 1(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.",
author = "Katsuhiro Ota",
year = "1995",
month = "10",
day = "13",
doi = "10.1016/0012-365X(94)00036-I",
language = "English",
volume = "145",
pages = "201--210",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Cycles through prescribed vertices with large degree sum

AU - Ota, Katsuhiro

PY - 1995/10/13

Y1 - 1995/10/13

N2 - Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σk + 1(S; G). We obtain a sharp lower bound of σk + 1(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.

AB - Let S be a set of vertices of a k-connected graph G. We denote the smallest sum of degrees of k + 1 independent vertices of S by σk + 1(S; G). We obtain a sharp lower bound of σk + 1(S; G) for the vertices of S to be contained in a common cycle of G. This result gives a sufficient condition for a k-connected graph to be hamiltonian.

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

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

U2 - 10.1016/0012-365X(94)00036-I

DO - 10.1016/0012-365X(94)00036-I

M3 - Article

AN - SCOPUS:0038282286

VL - 145

SP - 201

EP - 210

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -