Domination in Graphs Theory and Applications

By VRUSHALI NILKANTHRAO RAUT

In this chapter we collect some basic definitions and the-orems on graphs and hypergraphs which are needed for the subse-quent chapters. For graph theoretic terminology we refer to Chartrand and Lesniak [8] and for hypergraphs, we basically use the terminology of Berge [4, 5].

In Section 1.2 we give a brief outline of the basic definitions in graph theory and present the concept of minimal and maximal P-sets, where Pis a graph theoretic property concerning subsets of the vertex set V. In Section 1.3 we give a brief outline of the basic definitions in hypergraph theory, and in section 1.4 we present the fundamentals of domination in graphs and list some of the theo-rems that we use in subsequent chapters. In Section 1.5 we deal with algorithmic aspects, complexity results and NP-completeness. In Section 1.6 we present an overview of the organization of the remaining chapters of the book.

• Format: Paperback
• Language: English
• ISBN: 1805249975
• ISBN13: 9781805249979
• Release Date: February 2023
• Publisher: Independent Author
• Length: 90 Pages
• Weight: 0.32 lbs.
• Dimensions: 0.2" x 6.0" x 9.0"