几类图的同构因子分解  

Isomorphic Factorization of Several Types of Graphs

作　　者：周永生[1] 

机构地区：[1]甘肃工业大学基础课教学研究部

出　　处：《甘肃工业大学学报》1989年第2期95-101,共7页Journal of Gansu University of Technology

摘　　要：本文解决了以下几类图的同构因子分解问题:1.G=C_n<j_1,j_2,…,j_r>×P_s,n为偶数,k为C_n<j_1,j_2,…,j_r>每点的度数,ks+2s-2为素数;2.G=C_n<j_1,j_2,…,j_r>×P_s,其中j_rn/2,s为偶数,rs+s-1为素数;3.G=C_n<j_1,j_2,…,j_(r-1),n/2>×C_s,其中n为偶数,2r+1为素数。The following problems dealing with isomorphic factorization of several types of graphs are solved in this paper: 1. ,where n is a even number, ks + 2s- 2 is a prime number, and k is the degree of node of where sis a even number, and is a prime number; 3. where n is a even number and 2r+ 1 is a prime number.

关 键 词：同构因子分解 笛卡儿积 

分 类 号：O157.5[理学—数学]