几类本原有向图的Scrambling指数和m-Competition指数应用数学专业论文.docxVIP

I II The Scrambling Index and m-Competition index of Two Special Classes of Primitive Digraphs Abstract As a branch of combinatorial mathematics, the HYPERLINK /combinatorial_property combinatorial property in graph theory played a very important role in both math itself and a large variety of social activities. This article obtained a upper bound of the Scrambling index of a class of primitive digraphs and the Scrambling index and m-Competition index of a special class of primitive digraphs with one loop by using some methods of number theory based on the characteristic of those digraphs. In chapter 1 we introduce the basic knowledge of graph theory, which including the concept of primitive digraphs, scrambling index and m-competition index. We also provide the newest research development and the main conclusions of this article. In Chapter 2 we focus on the research of the upper bound of a special class of primitive digraphs. In Chapter 3 we first show the upper bound of the Scrambling index, index set and digraphs that reach the upper bound of a special class of primitive digraphs with one loop. Then we show the upper bound of the m-Competition index and digraphs that reach that bound of that class of digraphs. Key words: Primitive digraphs, Scrambling index, m-Competition index. I III 目 录 第一章 引言 1 §1.1 组合数学和图论的简单介绍1 HYPERLINK \l _TOC_250003 §1.2 图与 Scrambling 指数以及 m-Competition 指数的相关概念 2 HYPERLINK \l _TOC_250002 §1.3 Scrambling 指数的研究现状 3 HYPERLINK \l _TOC_250001 §1.4 Scrambling 指数的研究方法举例 4 §1.5 本文的主要结论 7 第二章 第一类特殊的含环本原有向图的 Scrambling 指数和 m-Competition 指数 9 §2.1 预备知识 9 §2.2 主要结论 9 HYPERLINK \l _TOC_250000 第三章一类本原有向图 Scrambling 指数的上界 13 §3.1 预备知识13 §3.1 主要结论13 结束语 17 参考文献 18 攻读硕士学位期间发表的论文及所取得的研究成果 22 致谢 23 中北 中北大学学位论文 1 1 第一章 引言 §1.1 组合数学和图论的简单介绍 组合数学是数学的一个分支，一般进行离散数学中排列组合的研究。广义的组合数 学就是离散数学，离散数学是狭义的组合数学和图论、代数结构、数理逻辑等的总称。 但这只是不同学者在叫法上的区别。总之，组合数学是一门研究离散对象的科学。因为 计算机科学的核心内容就是使用算法处理离散数据，所以致使离散数学成为计算机科学 和计算机算法研究的核心工具。随着计算机科学的日益发展，组合数学的重要性也日渐