(K_(1,4);2)图的最小walk(英文)

Shortest walk in(K_(1,4);2)-graphs

考虑一种包含无爪图的图类 (K1,4 ;2 ) 图 ,给出了关于walk的几个结果 ,特别是关于过给定点恰好一次的最小coveringwalk .

In this paper, we consider the family of (K_(1,4);2)-graphs which contains a claw-free graph and give some results on walks, especially on shortest covering walk visiting only once some given vertices.