| 图的割宽极值问题 |
| |
| 引用本文： | 郝建修,杨爱峰. 图的割宽极值问题[J]. 数学季刊, 2006, 21(1): 38-43 |
| |
| 作者姓名： | 郝建修 杨爱峰 |
| |
| 作者单位： | Department of Mathematics，Zhejiang Normal University，Jinhua 321004，China; School of Mathematical Sciences，South China University of Technology，Guangzhou 510641，China |
| |
| 基金项目： | Supported by the Zhejiang Provincial Natural Science Foundation of China(102055)，Supported by the NSF of China(10471131)，Supported by the Foundation of Zhejiang Universities' Youth Teachers |
| |
| 摘 要： | The problem studied in this paper is to determine e(p, C), the minimum size of a connected graph G with given vertex number p and cut-width C.
|
| 关 键 词： | 图表标签 截取宽度 数值图 顶点数 |
Extremal Cut-width Problem for Graphs |
| |
| HAO Jian-xiu,YANG Ai-feng. Extremal Cut-width Problem for Graphs[J]. Chinese Quarterly Journal of Mathematics, 2006, 21(1): 38-43 |
| |
| Authors: | HAO Jian-xiu YANG Ai-feng |
| |
| Affiliation: | [1]Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China; [2]School of Mathematical Sciences, South China University of Technology, Guangzhou 510641, China |
| |
| Abstract: | The problem studied in this paper is to determine e(p, C), the minimum size of a connected graph G with given vertex number p and cut-width C. |
| |
| Keywords: | graph labeling cut-width extremal graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
