Primitive Exponent Of Special Digraphs

The combinational theory of nonegative matrix researches the qualities that depend on the pattern of matrix and to be unconcerned with the value of matrix element .It has close relation with some quality of graph,and has relatively application in many areas such as information science ,communication networks,computer science.Primitive exponent is an important research content in the combinational theory of nonegative matrix.By establishing one-to-one relationship between nonegative matrix and digraph, the problem of matrices can transform into the problem of digraphs. This paper discusses two classes of special two-colored digraph, and the paper is divided into 3 chapters.In chapter 1, we briefly introduce the development and content on graph theory and combinational theory of nonegative matrix. Also describes some basic concept and principles of domestic and international studies, and set up this job.In chapter 2, a class of special two-colored digraph whose uncolored digraph consists of n 2 -cycles and two m -cycles is considered. Using the method of combinational matrix theory and graph theory , the primitive contions and the bound on the exponent are given.In chapter 3, another class of special two-colored digraph whose uncolored digraph just has one n -cycle,one (n - 1)-cycle and one (n - 2)-cycle is considered. Firstly we dye it ,then discuss the primitive contions.Lastly, the bound on the exponent are given.