摘要
从图的度数列入手,采用一种特殊的构造方法,不仅得到了3-点连通简单图的最少边数c(G)的值,还得到了图的边数最少时的连通简单图.
Starting with the degree sequence of a graph and by a special construction method, not only the minimum number of edges of 3-connected simple graphs but also the graphs with such number of edges were obtained.
出处
《北京师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2011年第4期339-343,共5页
Journal of Beijing Normal University(Natural Science)
基金
国家自然科学基金资助项目(11071017)
关键词
度数列
3-点连通简单图
简单图化
最少边数
degree sequence
3-connected simple graph
graph simplification
least edges
