| 最少边数的n阶3-点连通简单图及其构造 |
| |
| 引用本文： | 张秀平,肖旺裕.最少边数的n阶3-点连通简单图及其构造[J].北京师范大学学报(自然科学版),2011(4):339-343. |
| |
| 作者姓名： | 张秀平 肖旺裕 |
| |
| 作者单位： | 北京师范大学学数学科学学院; |
| |
| 基金项目： | 国家自然科学基金资助项目(11071017) |
| |
| 摘 要： | 从图的度数列入手,采用一种特殊的构造方法,不仅得到了3-点连通简单图的最少边数c(G)的值,还得到了图的边数最少时的连通简单图.
|
| 关 键 词： | 度数列 3-点连通简单图 简单图化 最少边数 |
THE 3-CONNECTED SIMPLE GRAPHS OF ORDER n WITH MINIMUM NUMBER OF EDGES AND THEIR CONSTRUCTION |
| |
| ZHANG Xiuping XIAO Wangyu.THE 3-CONNECTED SIMPLE GRAPHS OF ORDER n WITH MINIMUM NUMBER OF EDGES AND THEIR CONSTRUCTION[J].Journal of Beijing Normal University(Natural Science),2011(4):339-343. |
| |
| Authors: | ZHANG Xiuping XIAO Wangyu |
| |
| Institution: | ZHANG Xiuping XIAO Wangyu(School of Mathematical Science,Beijing Normal University,100875,Beijing,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | degree sequence 3-connected simple graph graph simplification least edges |
| 本文献已被 CNKI 等数据库收录！ |
