Retracts of infinite Hamming graphs
type: Item
instance of: scholarly article
title: Retracts of infinite Hamming graphs
zbMATH Open document ID: 0901.05040
author: Marc Chastand
published in: Journal of Combinatorial Theory. Series B
publication date: 1998-08-10T00:00:00Z
review text: A Hamming graph is a Cartesian product of complete graphs. We show that (finite or infinite) quasi-median graphs, which are a generalization of median graphs, are exactly the retracts of Hamming graphs. This generalizes a result of \textit{H. J. Bandelt} [J. Graph Theory 8, 501-510 (1984; Zbl 0551.05060)] about median graphs, and improves a result of \textit{E. Wilkeit} [Discrete Math. 102, No. 2, 191-218 (1992; Zbl 0759.05085)] and of \textit{F. R. K. Chung}, \textit{R. L. Graham} and \textit{M. E. Saks} [Combinatorica 9, No. 2, 111-131 (1989; Zbl 0692.05055)] about finite quasi-median graphs.
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 1154633
zbMATH Keywords: Hamming graph
zbMATH Keywords: Cartesian product
zbMATH Keywords: quasi-median graphs
zbMATH Keywords: retracts
MaRDI profile type: Publication
full work available at URL: jctb.1997.1746
OpenAlex ID: W1984272105
cites work: Quasi‐median graphs and algebras
cites work: Retracts of hypercubes
cites work: A dynamic location problem for graphs
cites work: Q3983321
cites work: Invariant Hamming graphs in infinite quasi-median graphs
cites work: Distance-preserving subgraphs of hypercubes
cites work: Gated sets in metric spaces
cites work: On Isometric Embeddings of Graphs
cites work: Skeletons, recognition algorithm and distance matrix of quasi-median graphs
cites work: Q4049082
cites work: Q4294601
cites work: Weak cartesian product of graphs
cites work: Q3890733
cites work: The smallest graph variety containing all paths
cites work: Graph multiplication
cites work: Prefibers and the cartesian product of metric spaces
cites work: The retracts of Hamming graphs
DOI: 10.1006/JCTB.1997.1746
Recommended article: The retracts of Hamming graphs
Recommended article: Invariant Hamming graphs in infinite quasi-median graphs
Recommended article: On the notion of infinite Hamiltonian graph
Recommended article: On Hamilton decompositions of infinite circulant graphs
Recommended article: Hamilton-decomposable graphs and digraphs of infinite valence
Recommended article: Generalized Hamming graphs: some new results
Recommended article: Hamming graphs in Nomura algebras
Recommended article: Resolvability of Hamming Graphs
Recommended article: The Hamiltonian property and connectivity of the Cartesian product of infinite graphs
description: scientific article; zbMATH DE number 1154633