✦ LIBER ✦

Perfect codes in the graphs Ok

✍ Scribed by P Hammond; D.H Smith

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 881 KB
Volume: 19
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(75)90087-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfect codes in graphs

✍ Norman Biggs 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 396 KB

On the non-existence of perfect and near

On the non-existence of perfect and nearly perfect codes

✍ Peter Hammond 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Embedding in a perfect code

✍ Sergey V. Avgustinovich; Denis S. Krotov 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

Nearly perfect sets in graphs

✍ Jean E. Dunbar; Frederick C. Harris Jr; Sandra M. Hedetniemi; Stephen T. Hedetni 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 871 KB

In a graph G = (V, E), a set of vertices S is nearly perfect if every vertex in V-S is adjacent to at most one vertex in S. Nearly perfect sets are closely related to 2-packings of graphs, strongly stable sets, dominating sets and efficient dominating sets. We say a nearly perfect set S is 1-minimal

Kernels in perfect line-graphs

✍ Frédéric Maffray 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 491 KB

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