✦ LIBER ✦

Hamming graphs in Nomura algebras

✍ Scribed by Ada Chan; Akihiro Munemasa

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 231 KB
Volume: 435
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.01.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distance-regular graphs of hamming type

✍ Kazumasa Nomura 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Isometric embeddings in Hamming graphs

✍ Elke Wilkeit 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 927 KB

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

Recognizing Hamming graphs in linear tim

Recognizing Hamming graphs in linear time and space

✍ Wilfried Imrich; Sandi Klavžar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 417 KB

Hamming graphs are, by definition, the Cartesian product of complete graphs. In the bipartite case these graphs are hypercubes. We present an algorithm recognizing Hamming graphs in linear time and space. This improves a previous algorithm which was linear in time but not in space. This also favorab