Download or read book Structures of Domination in Graphs written by Teresa W. Haynes and published by Springer Nature. This book was released on 2021-05-04 with total page 536 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume comprises 17 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The book is divided into 3 parts. The first part focuses on several domination-related concepts: broadcast domination, alliances, domatic numbers, dominator colorings, irredundance in graphs, private neighbor concepts, game domination, varieties of Roman domination and spectral graph theory. The second part covers domination in hypergraphs, chessboards, and digraphs and tournaments. The third part focuses on the development of algorithms and complexity of signed, minus and majority domination, power domination, and alliances in graphs. The third part also includes a chapter on self-stabilizing algorithms. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments and proof techniques used in the field.
Download or read book Domination in Graphs Core Concepts written by Teresa W. Haynes and published by Springer Nature. This book was released on 2023-04-29 with total page 655 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph is designed to be an in-depth introduction to domination in graphs. It focuses on three core concepts: domination, total domination, and independent domination. It contains major results on these foundational domination numbers, including a wide variety of in-depth proofs of selected results providing the reader with a toolbox of proof techniques used in domination theory. Additionally, the book is intended as an invaluable reference resource for a variety of readerships, namely, established researchers in the field of domination who want an updated, comprehensive coverage of domination theory; next, researchers in graph theory who wish to become acquainted with newer topics in domination, along with major developments in the field and some of the proof techniques used; and, graduate students with interests in graph theory, who might find the theory and many real-world applications of domination of interest for masters and doctoral thesis topics. The focused coverage also provides a good basis for seminars in domination theory or domination algorithms and complexity. The authors set out to provide the community with an updated and comprehensive treatment on the major topics in domination in graphs. And by Jove, they’ve done it! In recent years, the authors have curated and published two contributed volumes: Topics in Domination in Graphs, © 2020 and Structures of Domination in Graphs, © 2021. This book rounds out the coverage entirely. The reader is assumed to be acquainted with the basic concepts of graph theory and has had some exposure to graph theory at an introductory level. As graph theory terminology sometimes varies, a glossary of terms and notation is provided at the end of the book.
Download or read book Domination in Graphs written by TeresaW. Haynes and published by Routledge. This book was released on 2017-11-22 with total page 519 pages. Available in PDF, EPUB and Kindle. Book excerpt: ""Presents the latest in graph domination by leading researchers from around the world-furnishing known results, open research problems, and proof techniques. Maintains standardized terminology and notation throughout for greater accessibility. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on chessboards, and more.
Download or read book Fundamentals of Domination in Graphs written by Teresa W. Haynes and published by CRC Press. This book was released on 2013-12-16 with total page 465 pages. Available in PDF, EPUB and Kindle. Book excerpt: "Provides the first comprehensive treatment of theoretical, algorithmic, and application aspects of domination in graphs-discussing fundamental results and major research accomplishments in an easy-to-understand style. Includes chapters on domination algorithms and NP-completeness as well as frameworks for domination."
Download or read book Domination in Graphs written by TeresaW. Haynes and published by Routledge. This book was released on 2017-11-22 with total page 460 pages. Available in PDF, EPUB and Kindle. Book excerpt: ""Presents the latest in graph domination by leading researchers from around the world-furnishing known results, open research problems, and proof techniques. Maintains standardized terminology and notation throughout for greater accessibility. Covers recent developments in domination in graphs and digraphs, dominating functions, combinatorial problems on chessboards, and more.
Download or read book Distances and Domination in Graphs written by Ismael González Yero and published by MDPI. This book was released on 2020-11-18 with total page 146 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents a compendium of the 10 articles published in the recent Special Issue “Distance and Domination in Graphs”. The works appearing herein deal with several topics on graph theory that relate to the metric and dominating properties of graphs. The topics of the gathered publications deal with some new open lines of investigations that cover not only graphs, but also digraphs. Different variations in dominating sets or resolving sets are appearing, and a review on some networks’ curvatures is also present.
Download or read book Topics on Domination written by S.T. Hedetniemi and published by Elsevier. This book was released on 1991-02-01 with total page 287 pages. Available in PDF, EPUB and Kindle. Book excerpt: The contributions in this volume are divided into three sections: theoretical, new models and algorithmic. The first section focuses on properties of the standard domination number &ggr;(G), the second section is concerned with new variations on the domination theme, and the third is primarily concerned with finding classes of graphs for which the domination number (and several other domination-related parameters) can be computed in polynomial time.
Download or read book Total Domination in Graphs written by Michael A. Henning and published by Springer Science & Business Media. This book was released on 2014-07-08 with total page 184 pages. Available in PDF, EPUB and Kindle. Book excerpt: Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some of the topics featured include the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this text which enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in this field. Additionally, established researchers will find the book valuable to have as it contains the latest developments and open problems.
Download or read book Topics in Domination in Graphs written by Teresa W. Haynes and published by Springer Nature. This book was released on 2020-10-19 with total page 545 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results. The focus is on primary dominating sets such as paired domination, connected domination, restrained domination, dominating functions, Roman domination, and power domination. Additionally, surveys include known results with a sample of proof techniques for each parameter. Of extra benefit to the reader, the first chapter includes a glossary of commonly used terms; the second chapter provides an overview of models of domination from which the parameters are defined. The book is intended to provide a reference for established researchers in the fields of domination and graph theory and graduate students who wish to gain knowledge of the topics covered as well as an overview of the major accomplishments in the field and proof techniques used.
Download or read book Fuzzy Graph Theory written by Sunil Mathew and published by Springer. This book was released on 2017-12-30 with total page 331 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a timely overview of fuzzy graph theory, laying the foundation for future applications in a broad range of areas. It introduces readers to fundamental theories, such as Craine’s work on fuzzy interval graphs, fuzzy analogs of Marczewski’s theorem, and the Gilmore and Hoffman characterization. It also introduces them to the Fulkerson and Gross characterization and Menger’s theorem, the applications of which will be discussed in a forthcoming book by the same authors. This book also discusses in detail important concepts such as connectivity, distance and saturation in fuzzy graphs. Thanks to the good balance between the basics of fuzzy graph theory and new findings obtained by the authors, the book offers an excellent reference guide for advanced undergraduate and graduate students in mathematics, engineering and computer science, and an inspiring read for all researchers interested in new developments in fuzzy logic and applied mathematics.
Download or read book Accurate Independent Domination in Graphs written by B.Basavanagoud and published by Infinite Study. This book was released on with total page 10 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we initiate a study of this new parameter and obtain some results concerning this parameter.
Download or read book Combinatorial Optimization and Applications written by Ding-Zhu Du and published by Springer Nature. This book was released on 2021-12-10 with total page 726 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2021, which took place in Tianjin, China, during December 17-19, 2021. The 55 papers presented in this volume were carefully reviewed and selected from 122 submissions. They deal with combinatorial optimization and its applications in general, focusing on algorithms design, theoretical and experimental analysis, and applied research of general algorithmic interest.
Download or read book From Domination to Coloring written by Gary Chartrand and published by Springer Nature. This book was released on 2019-10-16 with total page 94 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is in honor of the 80th birthday of Stephen Hedetniemi. It describes advanced material in graph theory in the areas of domination, coloring, spanning cycles and circuits, and distance that grew out of research topics investigated by Stephen Hedetniemi. The purpose of this book is to provide background and principal results on these topics, along with same related problems and conjectures, for researchers in these areas. The most important features deal with material, results, and problems that researchers may not be aware of but may find of interest. Each chapter contains results, methods and information that will give readers the necessary background to investigate each topic in more detail.
Download or read book Some Parameters of Domination on the Neighborhood Graph written by M. H. Akhbari and published by Infinite Study. This book was released on with total page 13 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this paper, we obtain the domination number, the total domination number and the independent domination number in the neighborhood graph. We also investigate these parameters of domination on the join and the corona of two neighborhood graphs.
Download or read book Dominating Functions in Graphs written by Maria Talanda-Fisher and published by . This book was released on 2021 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: Domination in graphs has become one of the most popular areas of graph theory, no doubt due to its many fascinating problems and applications to modern society, as well as the sheer mathematical beauty of the subject. While this area evidently began with the work by the French mathematician Claude Berge in 1958 and the Norwegian-American mathematician Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of the survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then a large number of variations of domination have surfaced and provided numerous applications to dif- ferent areas of science and real-life problems. In 1987, Hedetniemi introduced the concept of dominating functions which (a) provided an analytic method of study- ing this discrete concept, (b) built a connection between domination and graph labelings and colorings, and (c) gave rise to new dominating function parameters. In 2019, Gary Chartrand introduced several variations of dominating functions in connection with some of the best-known concepts in graphs, including irregular- ity, regularity and chromaticity in graphs. In this research, we study irregular, antiregular, regular and proper dominating functions as well as total dominating functions in graphs. We present structural and extremal results dealing with these domination parameters and establish relationships between the concepts of various dominating functions and some well-known parameters in graphs.
Download or read book Irregular Orbital Domination in Graphs written by Peter Broe and published by . This book was released on 2022 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In recent decades, domination in graphs has become a popular area of study due in large degree to its applications to modern society and the mathematical beauty of the topic. While this area evidently began with the work of Claude Berge in 1958 and of Oystein Ore in 1962, domination did not become an active area of research until 1977 with the appearance of a survey paper by Ernest Cockayne and Stephen Hedetniemi. Since then a large number of variations of domination have surfaced and provided numerous applications to different areas of science and real-life problems. Among these variations are domination parameters defined in terms of distance and vertex orbits which provide a more general setting for domination in graphs. In this research, we study a new graph domination concept referred to as irregular orbital domination in graphs. This concept describes domination in the view of distance, vertex orbits, and graph labelings together with the well-known topic of irregularity in graphs. We determine the existence of irregular orbital domination for several well-studied classes of graphs, investigate structural and extremal problems dealing with irregular orbital domination in graphs, and explore relationships among this domination concept and traditional domination concepts.
Download or read book Algorithms and Discrete Applied Mathematics written by Amitabha Bagchi and published by Springer Nature. This book was released on 2023-01-26 with total page 464 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023, which was held in Gandhinagar, India, during February 9-11, 2023. The 32 papers presented in this volume were carefully reviewed and selected from 67 submissions. The papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering.
