Invariant Hamming graphs in infinite quasi-median graphs
type: Item
instance of: scholarly article
title: Invariant Hamming graphs in infinite quasi-median graphs
zbMATH Open document ID: 0864.05050
DOI: 10.1016/0012-365X(95)00151-L
author: Marc Chastand
author: Norbert Polat
published in: Discrete Mathematics
publication date: 1996-12-08T00:00:00Z
review text: A Hamming graph is a Cartesian product of complete graphs. The main results of the paper are: (i) a quasi-median graph without isometric rays contains a Hamming graph which is invariant under any automorphism; and (ii) any contraction of a rayless quasi-median graph stabilizes a finite Hamming graph.
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 955147
zbMATH Keywords: Hamming graph
zbMATH Keywords: quasi-median graph
zbMATH Keywords: isometric rays
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Regular pseudo-median graphs
cites work: Quasi‐median graphs and algebras
cites work: A fixed cube theorem for median graphs
cites work: A dynamic location problem for graphs
cites work: Gated sets in metric spaces
cites work: Q3890733
cites work: Fixed-edge theorem for graphs with loops
cites work: Aspects topologiques de la séparation dans les graphes infinis. I. II
cites work: Finite invariant simplices in infinite graphs
cites work: Retract‐collapsible graphs and invariant subgraph properties
cites work: Tensor Geometry
cites work: On the Helly property working as a compactness criterion on graphs
cites work: Prefibers and the cartesian product of metric spaces
cites work: On compact median graphs
cites work: The retracts of Hamming graphs
description: scientific article; zbMATH DE number 955147