✦ LIBER ✦

Retracts of Infinite Hamming Graphs

✍ Scribed by Marc Chastand

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 282 KB
Volume: 71
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1746

No coin nor oath required. For personal study only.

✦ Synopsis

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 Bandelt (1984,

📜 SIMILAR VOLUMES

Invariant Hamming graphs in infinite qua

Invariant Hamming graphs in infinite quasi-median graphs

✍ Marc Chastand; Norbert Polat 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 593 KB

It is shown that a quasi-median graph G without isometric infinite paths contains a Hamming graph (i.e., a cartesian product of complete graphs) which is invariant under any automorphism of G, and moreover if G has no infinite path, then any contraction of G into itself stabilizes a finite Hamming g

Absolute retracts of split graphs

✍ Sandi Klavžar 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 663 KB

It is proved that a split graph is an absolute retract of split graphs if and only if a partition of its vertex set into a stable set and a complete set is unique or it is a complete split graph. Three equivalent conditions for a split graph to be an absolute retract of the class of all graphs are g

Retracts of strong products of graphs

✍ W. Imrich; S. Klavžar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 750 KB

Characterizing subgraphs of Hamming grap

Characterizing subgraphs of Hamming graphs

✍ Sandi Klavžar; Iztok Peterin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph __G__ is an induced subgraph of a Hamming graph i

Minimal extensions of graphs to absolute

Minimal extensions of graphs to absolute retracts

✍ Erwin Pesch 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 631 KB

A graph H is an absolute retract if for every isometric embedding h of , , into a graph G an edge-preserving map g from G to H exists such that An absolute retract is uniquely determined by its set of embeddable vertices. We may regard this set as a metric space. We also prove that a graph (finite

A characterization of absolute retracts

A characterization of absolute retracts of n-chromatic graphs

✍ Erwin Pesch; Werner Poguntke 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 301 KB

A recursive characterization of the absolute retracts in the class of n-chromatic (connected) graphs is given.