Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4654626 | European Journal of Combinatorics | 2007 | 22 Pages |
Abstract
We bring together algebraic concepts such as equational class and various concepts from graph theory for developing a structure theory for graphs that promotes a deeper analysis of their metric properties. The basic operators are Cartesian multiplication and gated amalgamation or, alternatively, retraction. Specifically, finite weakly median graphs are known to be decomposable (relative to these operators) into smaller pieces that in turn are parts of hyperoctahedra, the pentagonal pyramid, or of certain triangulations of the plane. This decomposition scheme can be interpreted as Birkhoff’s subdirect representation in purely algebraic terms.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hans-Jürgen Bandelt, Victor Chepoi,