Retracts of Infinite Hamming Graphs
Copyright policy )Retracts of Infinite Hamming Graphs
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.
- Jean Moulin University Lyon 3 France
- UNIVERSITE JEAN MOULIN LYON III France
- Jean Moulin University Lyon 3 France
Distance in graphs, Hamming graph, Computational Theory and Mathematics, Cartesian product, Discrete Mathematics and Combinatorics, retracts, quasi-median graphs, Theoretical Computer Science
Distance in graphs, Hamming graph, Computational Theory and Mathematics, Cartesian product, Discrete Mathematics and Combinatorics, retracts, quasi-median graphs, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!