摘要
The cycle length distribution of a graph of order n is denoted by (c1,c2,...,cn), where ci is the number of cycles of length i. In this paper, we obtain that a graph G is uniquely determined by its cycle distribution if: (1) G = Kn,n+7 (n ≥ 10); or (2) G = Kn,n+7 - A (|A| = 1,n ≥ 12); or (3) G = Kn,n+7 - A (|A| = 2,n ≥ 14); or (4) G = Kn,n+7 - (|A| = 3,n ≥ 16), where A - E(Kn,n+7).
The cycle length distribution of a graph of order n is denoted by (c1,c2,...,cn), where ci is the number of cycles of length i. In this paper, we obtain that a graph G is uniquely determined by its cycle distribution if: (1) G = Kn,n+7 (n ≥ 10); or (2) G = Kn,n+7 - A (|A| = 1,n ≥ 12); or (3) G = Kn,n+7 - A (|A| = 2,n ≥ 14); or (4) G = Kn,n+7 - (|A| = 3,n ≥ 16), where A - E(Kn,n+7).
基金
the Science Foundation of Shanghai Municipal Education Commission (No.04DB25)
