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

Abstract

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