Generalized Competition Exponent And Generalized Scrambling Exponent Of Two Primitive Digraphs

Combinatorial mathematics is an important branch of mathematics, and graph theory isan important part of combinatorial mathematics. Combinatorial mathematics not only hasimportant application value in the software development of the computer, but also haspenetrated into all aspects of other subjects, such as its important application in the field ofcryptography, electronic engineering, economics, transportation planning.This thesis mainly studies the generalized competition indices and generalizedscrambling indices of two kinds of primitive digraph, the main contents are as follows:In the first chapter, it introduces the research history and its significance of combinatorialmathematics and graph theory, and its corresponding relationship between graph andnonnegative matrix. Moreover, it describes the basic concepts of the generalized competitionindex and generalized scrambling index of primitive digraph and the present thesises ofdomestic and overseas, and also lists the summary of this thesis.In the second chapter, it studies the generalized competition indices of two kinds ofprimitive digraph.In the third chapter, it studies the generalized scrambling indices of two kinds ofprimitive digraph.