摘要
文献[2]求出了临界h-连通图中一个特殊图类—A-图的最大边数.本文推广了这一结果,使其适用于一个更广泛的图类—F-图.
In the Ref[2], the maximum number of side of A-graphs was given , which was a particular class of graphs belonging to critically h-Connec-ted graphs. In this paper, the result is extented, so that it would be Valid for a more extensive class of graphs-F-graphs.
出处
《太原重型机械学院学报》
1989年第2期67-72,共6页
Journal of Taiyuan Heavy Machinery Institute
基金
山西矿业学院科研贷款赞助课题
关键词
图论
F-图
A-图
最大边数
maximum number of side of A-graphs
F-grapfs