含相邻圈长的本原有向图m-competition指数的研究

发布时间：2018-07-10 08:21

本文选题：有向图 + 本原有向图　；参考：《中北大学》2016年硕士论文

【摘要】：组合数学是数学界中一门有趣而有用的分支,其内容丰富、应用广泛、发展迅速.组合数学研究的主要对象是离散构形问题,如有趣的幻方问题.图论是研究离散对象的骨干分支,因而图论是组合数学最基础的课程之一.随着科学技术的发展,组合数学广泛的应用到数字通讯、管理学、电子学等诸多领域中,此外,在运筹学、规划论、计算机科学等新兴学科中取得了迅速的发展.文中详细地研究了含相邻圈长的n阶本原有向图的?ncompetitiom指数,其主要内容如下:第一章介绍了组合数学及图论的历史背景及意义,图论的一些基本概念以及?ncompetitiom指数的定义及研究现状,最后简单叙述本文的研究内容及取得的成果.第二章研究了含n?1圈和n?2圈的本原有向图的?ncompetitiom指数.第三章研究了三个n阶本原有向图的?ncompetitiom指数.
[Abstract]:Combinatorial mathematics is an interesting and useful branch of mathematics, which is rich in content, widely used and developed rapidly. The main object of combinatorial mathematics is discrete configuration problems, such as interesting magic square problems. Graph theory is the backbone branch of studying discrete objects, so graph theory is one of the most basic courses in combinatorial mathematics. With the development of science and technology, combinatorial mathematics has been widely used in many fields, such as digital communication, management, electronics and so on. In addition, it has made rapid development in new subjects such as operational research, planning theory, computer science and so on. The main contents of this paper are as follows: in chapter 1, the historical background and significance of combinatorial mathematics and graph theory are introduced. Some basic concepts of graph theory as well as the definition and research status of the exponent of ncompetitiom are given. Finally, the research contents and achievements of this paper are briefly described. In the second chapter, we study the index of ncompetitiom of the primitive digraphs with n ~ (1) and n ~ (2) cycles. In chapter 3, we study the exponents of three primitive digraphs of order n.
【学位授予单位】：中北大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：O157.5

【相似文献】