Research On Two Kinds Of Edge Domination Numbers Of Special Graphs

Graph theory is a kind of mathematical theory and methods.It take the graphs as the research object.A graph is composed of vertices and edges linking the vertices,and can can describe the relationship between things or events.The earliest dates of the generation of graph theory can trace back to 1736.With the development of technology,it has also become one of the fastest growing disciplines.The edge domination theory of graphs is regarded as a significant part of graph theory,the concept of signed edge total domination is proposed by Bao-gen Xu in 2006,since then,it has caused many scholars to discuss the signed edge total domination.The emergence of this concept not only expands the research scope of the edge control theory,but also adds new help to the development of graph theory.In addition to trees,circles,etc.,other special graphs also occupy an important position in the edge domination theory.The second chapter of this paper mainly studies the signed edge total domination of Gk,(m?2)which is composed by m cycles.We will first determine its domination function and then ask for its signed edge total domination.The inverse signed edge total domination of the graph was derived from the definition of signed edge total domination.The content of the third chapter will give the inverse signed edge total domination functions and inverse signed edge total domination numbers based on structural features of n-C3 and n-C4.