Chinese Quarterly Journal of Mathematics ›› 2006, Vol. 21 ›› Issue (1): 38-43.

Previous Articles     Next Articles

Extremal Cut-width Problem for Graphs

  

  1. Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China; School of Mathematical Sciences, South China University of Technology, Guangzhou 510641, China
  • Received:2003-02-25 Online:2006-03-30 Published:2023-12-18
  • About author:HAO Jian-xiu(1966-),male,native of Xingyang,Henan,an associate professor of Zhejiang Normal University,Ph.D.,engages in combinatorics and optimization.
  • Supported by:
     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;

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.

Key words: graph ,  , labeling, cut-width, extremal ,  , graph

CLC Number: