The Length of Dominating Cycles in a Kind of Graphs
Kong Shu-xia · Journal of Dezhou University · 2005
In simple finite graphs , we defined the concept of dominating cycles and proved that the length of dominating cycles in a kind of 2-connected graphs is 2σ-2,and this result improved the result of Tian Feng in some given conditions.