✦ LIBER ✦

Optimal Identifying Codes in Cycles and Paths

✍ Scribed by Ville Junnila, Tero Laihonen

Book ID: 113036255
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 200 KB
Volume: 28
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1058-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A family of optimal identifying codes in

✍ Iiro Honkala 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 90 KB

Optimal orientations of products of path

Optimal orientations of products of paths and cycles

✍ K.M. Koh; E.G. Tay 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 656 KB

For a graph G, let 9(G) be the family of strong orientations of G, d(G) = min{d(D) / D t 9' (G)} and p(G) = d(G) -d(G), where d(G) and d(D) are the diameters of G and D respectively. In this paper we show that p(G) = 0 if G is a Cartesian product of (I ) paths, and (2) paths and cycles, which satis

Two families of optimal identifying code

Two families of optimal identifying codes in binary Hamming spaces

✍ Ranto, S.M.; Honkala, I.S.; Laihonen, T.K. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 269 KB

Optimal Lee-Type Local Structures in Car

Optimal Lee-Type Local Structures in Cartesian Products of Cycles and Paths

✍ Špacapan, Simon 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 223 KB

On optimal orientations of Cartesian pro

On optimal orientations of Cartesian products of even cycles and paths

✍ Koh, K. M.; Tay, E. G. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

For a graph G , let D ( G ) be the family of strong orientations of G , and define d ៝ ( G ) Å min{d(D)ÉD √ D(G)}, where d(D) is the diameter of the digraph D. In this paper, we evaluate the values of d ៝ (C 2n 1

PATHS AND CYCLES IN COLORED GRAPHS

✍ Xueliang LI; Shenggui Zhang; Hajo Broersma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 186 KB