|
|
|||
|
||||
OverviewIn 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. Full Product DetailsAuthor: VRUSHALI NILKANTHRAO RAUTPublisher: independent self publisher Imprint: independent self publisher ISBN: 9781805249979ISBN 10: 1805249975 Pages: 124 Publication Date: 08 February 2023 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: Manufactured on demand We will order this item for you from a manufactured on demand supplier. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||