摘要
在图的顶点数和边数给定的一类图簇中,主要对图的最小最大连通分支的大小以及结构进行了研究,并且得到若干有意义的结果,这些结果为最小最大连通分支的应用提供了理论基础。
Given the number of vertices and the number of edges in a class of graphs, the size and the structure of the minimum maximum component of graphs are studied, through which some significant results are obtained. The obtained results provide a theoretical foundation for the application of the minimum maximum component.
出处
《空军工程大学学报（自然科学版）》
CSCD
2004年第2期89-91,共3页
Journal of Air Force Engineering University(Natural Science Edition)
关键词
图论
完全图
最大连通分支
最小最大分支
graph theory
completed graph
maximum component
minimum maximum component
