节点文献

偶图K_n,n-A（|A|=6）圈长分布的唯一性

Uniqueness of cycle length distribution of bipartite graphs

推荐 CAJ下载
PDF下载
不支持迅雷等下载工具，请取消加速工具后下载。

【Author】 YU Wen-hua1,ZHU Jian-ming1,SHA Dan2(1.College of Mathematics and Sciences,Shanghai Normal University,Shanghai 200234,China;2.School of International Economy and Trade,Shanghai Institute of Foreign Trade,Shanghai 201620,China)

【机构】上海师范大学数理信息学院；上海对外贸易学院国际经贸学院上海200234；上海200234；上海201620；

【摘要】阶为v的图G的圈长分布是序列(c1,c2,…,cv),其中ci是图G中长为i的圈数.计算了Kn,n-A(A E(Kn,n),|A|=6)的4圈数,以及证明了Kn,n-A(|A|=6,n≥22)是由它的圈长分布确定的.更多还原

【Abstract】 The cycle length distribution of a graph of order v is (c1,c2,…,cv),where ci is the number of cycles of length i.We derive formulas for counting the number of 4-cycles in K(n,n) -A(|A|= 6)and prove that K(n,n)A(|A|= 6,n ≥ 22)is determined by its cycle length distribution.更多还原