-PDF Download- Product Graphs EBOOK

Handbook of Product Graphs

Author: Richard Hammack

Publisher: CRC Press

Published: 2011-06-06

Total Pages: 537

ISBN-13: 1439813051

This handbook examines the dichotomy between the structure of products and their subgraphs. It also features the design of efficient algorithms that recognize products and their subgraphs and explores the relationship between graph parameters of the product and factors. Extensively revised and expanded, this second edition presents full proofs of many important results as well as up-to-date research and conjectures. It illustrates applications of graph products in several areas and contains well over 300 exercises. Supplementary material is available on the book's website.

Topics in Graph Theory

Author: Wilfried Imrich

Publisher: CRC Press

Published: 2008-10-27

Total Pages: 219

ISBN-13: 1439865337

DOWNLOAD EBOOK →

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way,

Product Graphs

Author: Wilfried Imrich

Publisher: Wiley-Interscience

Published: 2000-04-11

Total Pages: 384

ISBN-13:

DOWNLOAD EBOOK →

A comprehensive introduction to the four standard products of graphs and related topics Addressing the growing usefulness of current methods for recognizing product graphs, this new work presents a much-needed, systematic treatment of the Cartesian, strong, direct, and lexicographic products of graphs as well as graphs isometrically embedded into them. Written by two leading experts in this rapidly evolving area of combinatorics, Product Graphs: Structure and Recognition compiles and consolidates a wealth of information previously scattered throughout the literature, providing researchers in the field with ready access to numerous recent results as well as several new recognition algorithms and proofs. The authors explain all topics from the ground up and make the requisite theory and data structures easily accessible for mathematicians and computer scientists alike. Coverage includes * The basic algebraic and combinatorial properties ofproduct graph * Hypercubes, median graphs, Hamming graphs, triangle-free graphs, and vertex-transitive graphs * Colorings, automorphisms, homorphisms, domination, and the capacity of products of graphs Sample applications, including novel applications to chemical graph theory Clear connections to other areas of graph theory Figures, exercises, and hundreds of references

Stable Networks and Product Graphs

Author: Tomás Feder

Publisher: American Mathematical Soc.

Published: 1995

Total Pages: 242

ISBN-13: 0821803476

DOWNLOAD EBOOK →

The structural and algorithmic study of stability in nonexpansive networks is based on a representation of the possible assignments of Boolean values for a network as vertices in a Boolean hypercube under the associated Hamming metric. This global view takes advantage of the median properties of the hypercube, and extends to metric networks, where individual values are now chosen from the finite metric spaces and combined by means of an additive product operation. The relationship between products of metric spaces and products of graphs then establishes a connection between isometric representation in graphs and nonexpansiveness in metric networks.

Product Operations on q-Rung Orthopair Fuzzy Graphs

Author: Songyi Yin

Publisher: Infinite Study

Published:

Total Pages: 23

ISBN-13:

DOWNLOAD EBOOK →

The q-rung orthopair fuzzy graph is an extension of intuitionistic fuzzy graph and Pythagorean fuzzy graph. In this paper, the degree and total degree of a vertex in q-rung orthopair fuzzy graphs are firstly defined. Then, some product operations on q-rung orthopair fuzzy graphs, including direct product, Cartesian product, semi-strong product, strong product, and lexicographic product, are defined. Furthermore, some theorems about the degree and total degree under these product operations are put forward and elaborated with several examples. In particular, these theorems improve the similar results in single-valued neutrosophic graphs and Pythagorean fuzzy graphs.

Domination in Graphs

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.

Laplacian Eigenvectors of Graphs

Author: Türker Biyikoglu

Publisher: Springer

Published: 2007-07-07

Total Pages: 120

ISBN-13: 3540735100

DOWNLOAD EBOOK →

This fascinating volume investigates the structure of eigenvectors and looks at the number of their sign graphs ("nodal domains"), Perron components, and graphs with extremal properties with respect to eigenvectors. The Rayleigh quotient and rearrangement of graphs form the main methodology. Eigenvectors of graph Laplacians may seem a surprising topic for a book, but the authors show that there are subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs.

Handbook of Graph Theory

Author: Jonathan L. Gross

Publisher: CRC Press

Published: 2003-12-29

Total Pages: 1200

ISBN-13: 9780203490204

DOWNLOAD EBOOK →

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

Structures of Domination in Graphs

Author: Teresa W. Haynes

Publisher: Springer Nature

Published: 2021-05-04

Total Pages: 536

ISBN-13: 3030588920

DOWNLOAD EBOOK →

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.

Distances and Domination in Graphs

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.