✦ LIBER ✦

Isometric embeddings in Hamming graphs

✍ Scribed by Elke Wilkeit

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 927 KB
Volume: 50
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90073-9

No coin nor oath required. For personal study only.

📜 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

Completely Transitive Codes in Hamming G

Completely Transitive Codes in Hamming Graphs

✍ Michael Giudici; Cheryl E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 169 KB

A code in a graph is a non-empty subset C of the vertex set V of . Given C, the partition of V according to the distance of the vertices away from C is called the distance partition of C. A completely regular code is a code whose distance partition has a certain regularity property. A special class

Finding Optimal Routings in Hamming Grap

Finding Optimal Routings in Hamming Graphs

✍ Tian Khoon Lim; Cheryl E. Praeger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 191 KB

A routing R in a graph consists of a simple path p uv from u to v for each ordered pair of distinct vertices (u, v). We will call R optimal if all the paths p uv are shortest paths and if edges of the graph occur equally often in the paths of R. In 1994, Solé gave a sufficient condition involving th

Induced embeddings in Steinhaus graphs

✍ Delahan, Franz A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB 👁 2 views

Fix any positive integer n. Let S be the set of all Steinhaus graphs of order n(n -1)/2 + 1. The vertices for each graph in S are the first n(n -1)/2 + 1 positive integers. Let I be the set of all labeled graphs of order n with vertices of the form i(i -1)/2 + 1 for the first n positive integers i.

On optimal embeddings of metrics in grap

On optimal embeddings of metrics in graphs

✍ Wilfried Imrich; J.M.S Simões-Pereira; Christina M Zamfirescu 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Embedding of graphs in two-irregular gra

Embedding of graphs in two-irregular graphs

✍ M. Axenovich; Z. Füredi 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB 👁 1 views