MAXIMUM CUTWIDTH PROBLEM FOR GRAPHS

• 作 者: HaoJianxiu
• 机 构: DeptofMathZhejiangNormalUnivJinhus321004
• 出 处: 高校应用数学学报：英文版
• 发表日期: 2003年2期
• 关键词: 连通图 最大割宽问题 顶点 边 VLSI设计 形式模型 graph labeling cutwidth extremal graph.
• 基金项目: Supported by Natural Science Foundation of Zhejiang Province(1 0 2 0 5 5 )

The problem studied in this paper is to determine E(p,C),the maximum size of a connected graph G with the given vertex number p and cutwidth C.This paper presents some results on this problem.