由圈长分布确定的偶图的几个定理  

Some Theorems of Bipartite Graphs Determined by their Cycle Length Distributions

作　　者：施永兵[1] 刘荣官[1] 

机构地区：[1]上海师范大学数理信息学院,上海200234

出　　处：《上海师范大学学报（自然科学版）》2003年第4期14-17,共4页Journal of Shanghai Normal University(Natural Sciences)

基　　金：上海市高校科技发展基金(02DK08)

摘　　要：阶为n的图G的圈长分布是序列(c_1,c_2,…,c_n),其中c_i是图G中长为i的圈数.得到如下结果:(1)设A E(K_n,n),则当K_(n,n)[A] K_(l,j)或K_(n,n)[A] jK_2时,K_(n,n)—A是由它的圈长分布确定;(2)设A E(K_(n,n),|A|=4,n≥11,则K_(n,n)—A是由它的圈长分布确定的.The cycle length distribution of a graph of order n is (c1 ,c2 ,…cn) > where ci is the number of cycles of length i. We obtain the following results: (1) Let AE(Kn,n) , n≥j(j + 1)/2 + 1 , and Kn,n[A] ≌K1,j or Kn,n[A]≌jK2, then Kn,n -A is determined by its cycle length distribution; (2) Let AE(Kn,n,| A | = 4, and n≥11, then Kn,n -A is determined by its cycle length distribution.

关 键 词：圈 圈长分布 偶图 圈长分布确定的图 

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