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.
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,
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
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.
""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.
MATRIX is Australia’s international and residential mathematical research institute. It facilitates new collaborations and mathematical advances through intensive residential research programs, each 1-4 weeks in duration. This book is a scientific record of the ten programs held at MATRIX in 2019 and the two programs held in January 2020: · Topology of Manifolds: Interactions Between High and Low Dimensions · Australian-German Workshop on Differential Geometry in the Large · Aperiodic Order meets Number Theory · Ergodic Theory, Diophantine Approximation and Related Topics · Influencing Public Health Policy with Data-informed Mathematical Models of Infectious Diseases · International Workshop on Spatial Statistics · Mathematics of Physiological Rhythms · Conservation Laws, Interfaces and Mixing · Structural Graph Theory Downunder · Tropical Geometry and Mirror Symmetry · Early Career Researchers Workshop on Geometric Analysis and PDEs · Harmonic Analysis and Dispersive PDEs: Problems and Progress The articles are grouped into peer-reviewed contributions and other contributions. The peer-reviewed articles present original results or reviews on a topic related to the MATRIX program; the remaining contributions are predominantly lecture notes or short articles based on talks or activities at MATRIX.
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.
This book contains the successful invited submissions to a Special Issue of Symmetry on the subject of “Graph Theory”. Although symmetry has always played an important role in Graph Theory, in recent years, this role has increased significantly in several branches of this field, including but not limited to Gromov hyperbolic graphs, the metric dimension of graphs, domination theory, and topological indices. This Special Issue includes contributions addressing new results on these topics, both from a theoretical and an applied point of view.
It is hard to imagine a world without electronic communication networks, so dependent have we all become on the networks which now exist and have become part of the fabric of our daily lives. This book presents papers from CECNet 2023, the 13th International Conference on Electronics, Communications and Networks, held as a hybrid event, in person in Macau, China and online via Microsoft Teams, from 17-20 November 2023. This annual conference provides a comprehensive, global forum for experts and participants from academia to exchange ideas and present the results of ongoing research in state-of-the-art areas of electronics technology, communications engineering and technology, wireless communications engineering and technology, and computer engineering and technology. A total of 324 submissions were received for the conference, and those which qualified by virtue of falling under the scope of the conference topics were exhaustively reviewed by program committee members and peer-reviewers, taking into account the breadth and depth of the relevant research topics. The 101 selected contributions included in this book present innovative, original ideas or results of general significance, supported by clear and rigorous reasoning and compelling new light in both evidence and method. Subjects covered divide broadly into 3 categories: electronics technology and VLSI, internet technology and signal processing, and information communication and communication networks. Providing an overview of current research and developments in these rapidly evolving fields, the book will be of interest to all those working with digital communications networks.
Aimed at "the mathematically traumatized," this text offers nontechnical coverage of graph theory, with exercises. Discusses planar graphs, Euler's formula, Platonic graphs, coloring, the genus of a graph, Euler walks, Hamilton walks, more. 1976 edition.
