论文部分内容阅读
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