Download or read book Handbook of Research on Advanced Applications of Graph Theory in Modern Society written by Pal, Madhumangal and published by IGI Global. This book was released on 2019-08-30 with total page 591 pages. Available in PDF, EPUB and Kindle. Book excerpt: In the world of mathematics and computer science, technological advancements are constantly being researched and applied to ongoing issues. Setbacks in social networking, engineering, and automation are themes that affect everyday life, and researchers have been looking for new techniques in which to solve these challenges. Graph theory is a widely studied topic that is now being applied to real-life problems. The Handbook of Research on Advanced Applications of Graph Theory in Modern Society is an essential reference source that discusses recent developments on graph theory, as well as its representation in social networks, artificial neural networks, and many complex networks. The book aims to study results that are useful in the fields of robotics and machine learning and will examine different engineering issues that are closely related to fuzzy graph theory. Featuring research on topics such as artificial neural systems and robotics, this book is ideally designed for mathematicians, research scholars, practitioners, professionals, engineers, and students seeking an innovative overview of graphic theory.
Download or read book Connected Dominating Set Theory and Applications written by Ding-Zhu Du and published by Springer Science & Business Media. This book was released on 2012-10-26 with total page 206 pages. Available in PDF, EPUB and Kindle. Book excerpt: The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.
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 Domination in Graphs Theory and Applications written by Manju Raju and published by Independent Author. This book was released on 2023-02-03 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.
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 Graph Theory with Applications to Algorithms and Computer Science written by Y. Alavi and published by Wiley-Interscience. This book was released on 1985-10-02 with total page 842 pages. Available in PDF, EPUB and Kindle. Book excerpt: An applications-oriented text detailing the latest research in graph theory and computer science. Leading contributors cover such important topics as: tiling problems and graph factors; partitioning the nodes of a graph; diameter vulnerability in networks; edge-disjoint Hamiltonian cycles; the cochromatic number of graphs in a switching sequence; and more.
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 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 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 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 Recent Developments in the Theory of Domination in Graphs and Its Applications written by H. B. Walikar and published by . This book was released on 1979 with total page 241 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Studies in Graph Theory Support Domination in Graphs and Related Concepts written by C. Y. Ponnappan and published by Archers & Elevators Publishing House. This book was released on with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
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 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 Handbook of Graph Theory written by Jonathan L. Gross and published by CRC Press. This book was released on 2003-12-29 with total page 1200 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approach
Download or read book Graph Theory with Applications to Engineering and Computer Science written by Narsingh Deo and published by PHI Learning Pvt. Ltd.. This book was released on 1974 with total page 478 pages. Available in PDF, EPUB and Kindle. Book excerpt: Because of its inherent simplicity, graph theory has a wide range of applications in engineering, and in physical sciences. It has of course uses in social sciences, in linguistics and in numerous other areas. In fact, a graph can be used to represent almost any physical situation involving discrete objects and the relationship among them. Now with the solutions to engineering and other problems becoming so complex leading to larger graphs, it is virtually difficult to analyze without the use of computers. This book is recommended in IIT Kharagpur, West Bengal for B.Tech Computer Science, NIT Arunachal Pradesh, NIT Nagaland, NIT Agartala, NIT Silchar, Gauhati University, Dibrugarh University, North Eastern Regional Institute of Management, Assam Engineering College, West Bengal Univerity of Technology (WBUT) for B.Tech, M.Tech Computer Science, University of Burdwan, West Bengal for B.Tech. Computer Science, Jadavpur University, West Bengal for M.Sc. Computer Science, Kalyani College of Engineering, West Bengal for B.Tech. Computer Science. Key Features: This book provides a rigorous yet informal treatment of graph theory with an emphasis on computational aspects of graph theory and graph-theoretic algorithms. Numerous applications to actual engineering problems are incorpo-rated with software design and optimization topics.
