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 k-connected graph of order n (and of independent number α) contains all vertices of degree at least d.

Keywords

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