山东科学2004，Vol.17Issue(4)：1-4,4.
(K1,4;2)-图的最小walk
Shortest walk in(K 1,4;2)-graphs
蔺厚元 1高宏2
作者信息
- 1. 山东师范大学数学科学学院,山东,济南,250014
- 2. 山东城市建设职业学院,山东,济南,250014
- 折叠
摘要
Abstract
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.关键词
(K1,4/2)-图/k-walk/无爪图/几乎无爪图Key words
(K1,4/2)-graph/k -walk/claw-free graph/almost claw-free graph分类
数理科学引用本文复制引用
蔺厚元,高宏..(K1,4;2)-图的最小walk[J].山东科学,2004,17(4):1-4,4.
