A Degree Condition for Dominating Cycles in t-tough Graphs with t>1

2012/01/07 by Zh. G. Nikoghosyan, Nikoghosyan, Zh. G. · 1 citation
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1201.1551

15 pages

arxiv created 2012/01/07 · arxiv updated 2012/01/10

Abstract

Let G be a t-tough graph of order n and minimum degree δ with t>1. It is proved that if δ≥(n-2)/3 then each longest cycle in G is a dominating cycle.

Cited by

• Hamilton and long cycles in t-tough graphs with t>1

Related

• Degree Conditions for Dominating Cycles in 1-tough Graphs
• Hamilton and long cycles in t-tough graphs with t>1
• Toughness and Vertex Degrees
• The minimum degree of minimally t-tough graphs
• Large cycles in 4-connected graphs