✦ LIBER ✦

Graphs, tessellations, and perfect codes on flat tori

✍ Scribed by Costa, S.I.R.; Muniz, M.; Agustini, E.; Palazzo, R.

Book ID: 114638458
Publisher: IEEE
Year: 2004
Tongue: English
Weight: 643 KB
Volume: 50
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2004.834754

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circulant graphs and tessellations on fl

Circulant graphs and tessellations on flat tori

✍ S.I.R. Costa; J.E. Strapasson; M.M.S. Alves; T.B. Carlos 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Circulant graphs and tessellations on fl

Circulant graphs and tessellations on flat tori

✍ S.I.R. Costa; J.E. Strapasson; M.M.S. Alves; T.B. Carlos 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Perfect Codes and Regular Partitions in

Perfect Codes and Regular Partitions in Graphs and Groups

✍ Etienne, Gwihen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 376 KB

On graphs and codes

✍ R. T. Curtis 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 281 KB

In a recent paper we showed how the binary Golay code can be obtained in a revealing way straight from the edge-graph of the icosahedron. This construction not only yields a natural basis for the code, but also supplies a simple description of all codewords. In this paper we show that the above is m

On wing-perfect graphs

✍ Hougardy, Stefan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

An edge in a graph G is called a wing if it is one of the two nonincident edges of an induced P 4 (a path on four vertices) in G. For a graph G, its winggraph W (G) is defined as the graph whose vertices are the wings of G, and two vertices in W (G) are connected if the corresponding wings in G belo

On critically perfect graphs

✍ Wagler, Annegret 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 2 views

A perfect graph is critical, if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We relate critically perfect graphs to well-known classes of perfect graphs, investigate the structure of the class of critically perfect graphs, a