Mathematics – Combinatorics
Scientific paper
2011-12-12
Mathematics
Combinatorics
29 pages
Scientific paper
Recently it was shown (by the author) that every graph of size $q$ (the number of edges) and minimum degree $\delta$ is hamiltonian if $q\le\delta^2+\delta-1$ (arXiv:1107.2201v1). In this paper we present the exact analog of this result for dominating cycles: if $G$ is a 2-connected graph with $q\le8$ if $\delta=2$ and $q\le (3(\delta-1)(\delta+2)-1)/2$ if $\delta\ge3$, then each longest cycle in $G$ is a dominating cycle. The result is sharp in all respects.
No associations
LandOfFree
A Size Upper Bound for Dominating Cycles 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 Size Upper Bound for Dominating Cycles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Size Upper Bound for Dominating Cycles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-708499