Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Topics in Graph Automorphisms and Reconstruction

View through CrossRef
This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphical regular representations and pseudosimilarity. The final four chapters are devoted to the reconstruction problem, and here special emphasis is given to those results that involve the symmetry of graphs, many of which are not to be found in other books. This second edition expands on several of the topics found in the first edition and includes both an enriched bibliography and a wide collection of exercises. Clearer proofs are provided, as are new examples of graphs with interesting symmetry properties. Any student who masters the contents of this book will be well prepared for current research in many aspects of the theory of graph automorphisms and the reconstruction problem.
Cambridge University Press
Title: Topics in Graph Automorphisms and Reconstruction
Description:
This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs.
Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphical regular representations and pseudosimilarity.
The final four chapters are devoted to the reconstruction problem, and here special emphasis is given to those results that involve the symmetry of graphs, many of which are not to be found in other books.
This second edition expands on several of the topics found in the first edition and includes both an enriched bibliography and a wide collection of exercises.
Clearer proofs are provided, as are new examples of graphs with interesting symmetry properties.
Any student who masters the contents of this book will be well prepared for current research in many aspects of the theory of graph automorphisms and the reconstruction problem.

Related Results

On certain decompositional properties of von Neumann algebras
On certain decompositional properties of von Neumann algebras
It is well known that if α and β are commuting *-automorphisms of a von Neumann algebra M satisfying the equation α + α-1 = β + β-1 then M can be decomposed into a direct sum of su...
Combinatorial Cremona automorphisms and Coxeter arrangement matroids
Combinatorial Cremona automorphisms and Coxeter arrangement matroids
Abstract We explore birational geometry of matroids by investigating automorphisms of their coarse Bergman fans. Combinatorial Cremona maps provide such automorphisms of ...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
Patient informational needs about breast reconstruction post-mastectomy.
Patient informational needs about breast reconstruction post-mastectomy.
88 Background: For many women, receiving a breast cancer diagnosis is further complicated by decisions they will face about breast reconstruction post-mastectomy. While women are ...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...

Back to Top