Dr Vadim Zverovich Vadim.Zverovich@uwe.ac.uk
Associate Professor
Methods of Graph Decompositions
Zverovich, Vadim; Skums, Pavel
Authors
Pavel Skums
Abstract
In general terms, a graph decomposition is a partition of a graph into parts satisfying some special conditions. Methods of Graph Decompositions discusses some state-of-the-art decomposition methods of graph theory, which are highly instrumental when dealing with a number of fundamental concepts such as unigraphs, isomorphism, reconstruction conjectures, k-dimensional graphs, degree sequences, line graphs and line hypergraphs.
The first part of the book explores the algebraic theory of graph decomposition, whose major idea is to define a binary operation that turns the set of graphs or objects derived from graphs into an algebraic semigroup. If an operation and a class of graphs are appropriately chosen, then, just as for integers, each graph has a unique factorization (or canonical decomposition) into a product of prime factors. The unique factorization property makes this type of decomposition especially efficient for problems associated with graph isomorphism, and several such examples are described in the book. Another topic is devoted to Krausz-type decompositions, that is, special coverings of graphs by cliques that are directly associated with representation of graphs as line graphs of hypergraphs. The book discusses various algorithmic and structural results associated with the existence, properties and applications of such decompositions.
In particular, it demonstrates how Krausz-type decompositions are directly related to topological dimension, information complexity and self-similarity of graphs, thus allowing to establish links between combinatorics, general topology, information theory and studies of complex systems. The above topics are united by the role played in their development by Professor Regina Tyshkevich, and the book is a tribute to her memory. The book will be ideal for researchers, engineers and specialists, who are interested in fundamental problems of graph theory and proof techniques to tackle them.
Book Type | Authored Book |
---|---|
Publication Date | Aug 6, 2024 |
Deposit Date | Oct 23, 2022 |
Publicly Available Date | Aug 7, 2025 |
Publisher | Oxford University Press |
ISBN | 9780198882091 |
Keywords | Graphs, Graph Decompositions |
Public URL | https://uwe-repository.worktribe.com/output/10100630 |
Publisher URL | https://global.oup.com/academic/product/methods-of-graph-decompositions-9780198882091?lang=en&cc=gb |
Contract Date | Sep 22, 2022 |
Files
This file is under embargo until Aug 7, 2025 due to copyright reasons.
Contact Vadim.Zverovich@uwe.ac.uk to request a copy for personal use.
You might also like
On general frameworks and threshold functions for multiple domination
(2015)
Journal Article
Braess’ paradox in asymmetrical traffic networks
(2014)
Presentation / Conference Contribution
The probabilistic approach to limited packings in graphs
(2015)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search