A fixed cube theorem for median graphs

DOI10.1016/0012-365X(87)90022-7MaRDI QIDQ1092929zbMATH OpenFDO

Authors Marcel van de Vel, Hans-Jürgen Bandelt

Publication date 1987

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(87)90022-7

zbMATH Keywords

cubeedge-preserving self-mapmedian graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Review text

The authors regard connected graphs in which any three points have a unique median (median graphs). The following theorem is proven: Every edge-preserving self-map of a median graph leaves a cube invariant. This extends a fixed edge theorem for trees and parallels.

Recommendations

• On cube-free median graphs
• n‐cubes and median graphs
• Median graphs and hypercubes, some new characterizations
• Medians in median graphs and their cube complexes in linear time
• Planar median graphs and cubesquare-graphs
• The cube polynomial and its derivatives: The case of median graphs
• On compact median graphs
• A new characterization of median graphs
• A characterization of median graphs
• Cube intersection concepts in median graphs

Cites work

• A Selection Theorem for Topological Convex Structures
• Binary Convexities and Distributive Lattices
• Fixed-edge theorem for graphs with loops
• scientific article; zbMATH DE number 3855190 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 3723495 (Why is no real title available?)
• scientific article; zbMATH DE number 3758994 (Why is no real title available?)
• Matching binary convexities
• Median Algebra
• Median algebras
• Medians in median graphs
• On an internal property of absolute retracts. II
• On the Helly property working as a compactness criterion on graphs
• Retracts of hypercubes
• Tensor Geometry
• The ideal structure of simple ternary algebras
• Vertex-to-vertex pursuit in a graph

Cited in

(18)

• Netlike partial cubes III. The median cycle property
• Invariant Hamming graphs in infinite quasi-median graphs
• A new fixed point approach for stable networks and stable marriages
• Algorithms for the fixed point property
• A fixed box theorem for the cartesian product of graphs and metric spaces
• An Euler-type formula for median graphs
• Fibonacci \((p,r)\)-cubes which are median graphs
• Graphs of some CAT(0) complexes
• Tree-like partial Hamming graphs
• Regular pseudo-median graphs
• More on linear and metric tree maps
• On compact median graphs
• An axiomatization of the median procedure on the \(n\)-cube
• What do trees and hypercubes have in common?
• A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
• Absolute reflexive retracts and absolute bipartite retracts
• An introduction to diagram groups
• On cube-free median graphs

This page was built for publication: A fixed cube theorem for median graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092929)