关于图中的支配圈

On D-cyclic in Graph

H.J.Veldman给出了简单图含有D-圈的一个充分条件。本文也给出了一个充分条件,从而推广了H.J.Velbman的结果。

The degree of an edge e of G, denoted dG(e)or d(e), is | N(V(e)) | (Viewed as a subgraph of G of order two) . This paper proves that: Let G be a connected graph of order p, If d(e 1) + d(e 2)>p- 3 for each pair of eages e1 and e2 such that the distance between e1 and e2 is 2, then G has a D-cyclic.