Large Degree Vertices in Longest Cycles of Graphs, I

• Autorzy: Binlong Li , Liming Xiong , Jun Yin
• Języki publikacji: EN

Abstrakty

EN

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

Słowa kluczowe

EN

longest cycle; large degree vertices; order; connectivity; independent number

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2016
• Tom: 36
• Numer: 2
• Strony: 363-382

Daty

wydano

2016-05-01

otrzymano

2014-12-08

poprawiono

2015-05-13

zaakceptowano

2015-07-12

online

2016-04-15

Twórcy

autor

Binlong Li

• Department of Applied Mathematics Northwestern Polytechnical University Xi′an, Shaanxi 710072, P.R. China
• Department of Mathematics University of West Bohemia 306 14 Plzeň, Czech Republic

autor

Liming Xiong

• School of Mathematics and Statistics Beijing Institute of Technology Beijing, 100081, P.R. China
• Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing, 100081, P.R. China

autor

Jun Yin

• School of Mathematics and Statistics Beijing Institute of Technology Beijing, 100081, P.R. China
• School of Computer Science Qinghai Normal University Xining, Qinghai, 810008, P.R. China

Identyfikatory

DOI

10.7151/dmgt.1861