关于几类图的分数色数与分数全色数的研究运筹学与控制论专业论文.docxVIP

山东科技大学硕士学位论文摘要 山东科技大学硕士学位论文 摘要 摘 要 图的着色问题是图论中的一个重要研究课题之一 .分数着色是顶点着色的一个 推广,对于某些具体问题,它能更好地刻画解决,分数色数作为图的重要参数之一,是 非常具有研究价值的. 在第二章中,首先给出了图的分数色数的几种等价定义 ,接着研究了几类特殊图 的分数色数,包括星图,风车图及在此基础上扩充的相应的冠图及齿轮图. 在第三章中,首先介绍了循环图和图的邻接矩阵的定义 ,然后通过构造图的最大 独立集,研究了两类 6-正则循环图的分数色数. 在第四章中,介绍了广义 Peterson 图的概念及它的等价定义,考虑并研究了 k=3 时的广义 Peterson 图的分数色数. 在第五章中,根据全着色猜想研究了几类 Mycielski 图的分数全染色,包括星图, 扇图,轮图和皇冠图,拓展了图染色的领域,便于更好地研究图的结构. 关键词:分数色数,循环图,广义 Peterson 图,Mycielsk i 图,分数全色数 ABSTRACT The issue of color ing is a very important problem in the graph theory. The fractiona l chromatic number of a graph is a variation of the chromatic number. It can provide a better model for some specia l problems. As an important parameter, the chromatic number of the graph has the values of study. In the second chapter, the equiva lent definition of fractiona l chromatic number is given, then we most ly study the fractiona l chromatic number of some specia l graphs, including the Star Graph, Wind mill Graph, Crown Graph and Gear Graph. In the third chapter, we first ly study the definition of circula nt graph and adjacency matrix. Then, we show the fractiona l chromatic number of two classes of 6-regular circula nt graphs by construct ing the largest independent set and fractiona l color ing of a graph G . In the fourth chapter, the equiva lent definition of genera l Peterson Graph is given, and we most ly study the fractiona l chromatic number of genera l Peterson Graph when k is equal to 3. In the fifth chapter, according to the conject ure of total color ing, the total fractiona l chromatic number of some Mycielsk i Graph is studied, including Star Graph, Fan Graph, Wheel Graph and Crown Graph. It exploits the area of the graph color ing and makes for studying the structure of graphs. Keywords: The fractiona l chromatic number, Circulant graph, Genera l Peterson Graph, Mycielsk i Graph, The total fractiona l chromatic number 山东科技大学硕士学位论文目录 山东科技大学硕士学位论文 目录 目 录 1 绪论1 1.1 问题的提出 1 1.2 国内外研究现状 4 1.3 基本符