关于D_λ－闭迹

On D_λ-Circults

得到了图有Ｄ＿λ－闭迹的一个结果，这个结果是Ｓ－闭迹和Ｄ－闭迹中一些结果的推广。

In this paper,a circuit C of a graph G is called a D_λ-circuit if every component of G-V ( C )hasorder less than λ. A sufficient condition is derived for graphs to have a D_λ-circuit.The result is ageneralization of the theorem in Euler subgraph theory.