Distances and Domination in Graphs

Distances and Domination in Graphs PDF

Author: Ismael González Yero

Publisher: MDPI

Published: 2020-11-18

Total Pages: 146

ISBN-13: 3039435159

DOWNLOAD EBOOK →

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.

Distances and Domination in Graphs

Distances and Domination in Graphs PDF

Author: Ismael González Yero

Publisher:

Published: 2020

Total Pages: 146

ISBN-13: 9783039435166

DOWNLOAD EBOOK →

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.

Domination in Graphs

Domination in Graphs PDF

Author: TeresaW. Haynes

Publisher: Routledge

Published: 2017-11-22

Total Pages: 519

ISBN-13: 1351454641

DOWNLOAD EBOOK →

""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.

Topics in Domination in Graphs

Topics in Domination in Graphs PDF

Author: Teresa W. Haynes

Publisher: Springer Nature

Published: 2020-10-19

Total Pages: 545

ISBN-13: 3030511170

DOWNLOAD EBOOK →

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.

Total Domination in Graphs

Total Domination in Graphs PDF

Author: Michael A. Henning

Publisher: Springer Science & Business Media

Published: 2014-07-08

Total Pages: 184

ISBN-13: 1461465257

DOWNLOAD EBOOK →

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.

Fundamentals of Domination in Graphs

Fundamentals of Domination in Graphs PDF

Author: Teresa W. Haynes

Publisher: CRC Press

Published: 2013-12-16

Total Pages: 465

ISBN-13: 1482246589

DOWNLOAD EBOOK →

"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."

Quantum Probability and Spectral Analysis of Graphs

Quantum Probability and Spectral Analysis of Graphs PDF

Author: Akihito Hora

Publisher: Springer Science & Business Media

Published: 2007-07-05

Total Pages: 384

ISBN-13: 3540488634

DOWNLOAD EBOOK →

This is the first book to comprehensively cover quantum probabilistic approaches to spectral analysis of graphs, an approach developed by the authors. The book functions as a concise introduction to quantum probability from an algebraic aspect. Here readers will learn several powerful methods and techniques of wide applicability, recently developed under the name of quantum probability. The exercises at the end of each chapter help to deepen understanding.

Domination in Graphs

Domination in Graphs PDF

Author: TeresaW. Haynes

Publisher: Routledge

Published: 2017-11-22

Total Pages: 507

ISBN-13: 1351454633

DOWNLOAD EBOOK →

""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.

Topics on Domination

Topics on Domination PDF

Author: S.T. Hedetniemi

Publisher: Elsevier

Published: 1991-02-01

Total Pages: 277

ISBN-13: 9780080867885

DOWNLOAD EBOOK →

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.