Study On Several Types Of Domination Parameters Of Graphs

An important issue in graph theory is the study of graph parameters.The domination parameters of graphs are an important area of graph theory research.This branch of research has a history of nearly two hundred years.In recent years,with the rapid development of information technology,graph domination theory has been widely used in many disciplines such as computer technology,cryptography,social networks,and communication networks.With the introduction of computer algorithms and functional methods,we have new ideas for dealing with some digital problems on discrete structures,Therefore,the domination theory has developed rapidly in recent years.The domination theory of the graph is shining,such as point domination,edge domination,signed domination,minus domination,and so on.Among them,the locally dominant problem is a very well-known problem in graph domination theory.With the development of theory,many new domination concepts have been proposed,and the domination theory of graphs has become more and more perfect.This paper focuses on the Fractional domination,the Strong(Weak)domination of graphs,which further enriches and improves the content of Fractional domination and the Strong(Weak)domination of graphs.The Fractional domination of a graph can be regarded as the optimization label of the graph,which is closely related to the optimization problem,and provides a practical and effective mathematical model for many practical problems,which can help solve more practical problems.The Strong(Weak)domination of the graph is also generated in the actual situation and is widely used in the design of transportation networks.Further study of these domination parameters provide strong theoretical support for practice.