Study On The M - Competition Index Of Primitive Graphs With Adjacent Circle Length

Combinatorial mathematics is an interesting and important branch of mathematics. It is rich in content, applied widely and developing rapidly. The main object which it researches is the problem of discrete configuration such as the interesting magic square. Graph theory is a diaphysial branch of discrete object, so it is one of the most fundamental courses of combinatorial mathematics. With the development of science and technology, combinatorial mathematics is applied to a lot of fields such as digital communication, management,electronics, etc. Moreover, combinatorial mathematics has gotten rapid development in the emerging disciplines, for example, operations research, programming theory, computer science, and so on.The thesis detailedly studies the m-competition indices of the primitive digraph of order n with the adjacent circles length, and the main contents are as follows:The first chapter introduces the historical background and significance of combinatorial mathematics and graph theory, some basic concepts of graph theory and the research status of m-competition index, and finally simply gives the research contents and the conclusions of the thesis.The second chapter studies the m-competition indices of primitive digraphs with n-1circle and n-2 circle.The third chapter studies the m-competition indices of three primitive digraphs of order n.