整循环图的性质The properties of the entire cyclic graph.pdfVIP

 Xn (D) Zn = {0, 1, 2, . . . , n − 1}, a b gcd(a − b, n) ∈ D, D n   ÆÆ℄Æ Æ - Æ Cayley ÆÆ Æ Æ Xn (1, d)  i Some Properties of Integral Circulant Graphs Major: Pure Mathematics Name: XIONG Tengfei Supervisor: Prof. Dr. TANG Gaohua ABSTRACT Integral circulant graph Xn (D) has the vertex set Zn = {0, 1, 2, . . . , n − 1} and vertices a and b are adjacent if and only if gcd(a − b, n) ∈ D, where D is a set of positive, proper divisors of n. Integral circulant graphs are highly symmetric, and they are widely applied in our life. In recent years, more and more experts devoted theirselves to the field, and the integral circulant graph has become a popular topic. The body of the thesis is divided into four chapters: In Chapter 1 of this paper, we summarize the history of integral circulant graphs, the back- ground and main results of this paper. In addition, we give the basic concepts of graph theory which will be used in the next chapters. In Chapter 2, we obtain a new characterization of integral circulant graph, and prove that all the integral circulant graphs are vertex-transitive and regular. We also determine the edge- connectivity of the integral circulant graphs, and prove that when the unitary Cayley graph is strongly regular. In addition, we determine that some integral circulant graphs are complete graphs or complete k-partite graphs, and we evaluate the size of the automorphism group of some integral circulant graphs. In Chapter 3,