A DEGREE SEQUENCE METHOD FOR THE CUTWIDTH PROBLEM OF GRAPHS

作     者：Lin Yixun Li Xianglu Yang Aifeng 

作者机构：Dept. of Math. Zhengzhou Univ. Henan China 

出 版 物：《Applied Mathematics(A Journal of Chinese Universities)》 (高校应用数学学报（英文版）（B辑）)

年 卷 期：2002年第17卷第2期

页      面：125-134页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：Supported by the National Natural Science Foundation of China (1 0 0 71 0 76 ) 

主　　题：combinatorial optimization graph labeling cutwidth bandwidth 

摘      要：The cutwidth problem fora graph G is to embed G into a path such thatthe maximum number of overlap edges is *** paperpresents an approach based on the degree se- quence of G for determining the exact value of cutwidth of typical graphs (e.g.,n- cube,cater- pillars) .Relations between the cutwidth and other graph- theoretic parameters are studied as wel