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

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

2012-01-07

arxiv.org/abs/1201.1551v1

Mathematics

Combinatorics

15 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Degree Condition for Dominating Cycles in $t$-tough Graphs with $t>1$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Degree Condition for Dominating Cycles in $t$-tough Graphs with $t>1$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Degree Condition for Dominating Cycles in $t$-tough Graphs with $t>1$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635282