|
|
.
|
|
|
0 (hodnocen0 x )
|
|
|
(2.5) Půjčeno:5x
|
|
|
BK
|
|
|
|
|
|
|
|
|
Praha : Academia, 1991
|
|
|
|
|
|
 |
|
|
ISBN 80-200-0412-2
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
000076994
|
|
|
Rekat.
|
|
|
CONTENTS // Contents... 3 // Preface... 5 // Notations... 7 // Introduction... 9 // 1. Motivation... 9 // 2. Classical perfect codes... 13 // 3. Perfect codes in distance regular graphs ... 15 // Perfect codes in general graphs... 20 // 4. Packings, dominating sets and perfect codes ... 21 // 5. Perfect codes in a random graph... 28 // 6. Perfect codes and Seidel’s switching... 34 // 7. Computational complexity of codes in graphs... 46 // 7.1 Perfect code completion... 49 // 7.2 Perfect codes in regular graphs... 54 // 7.3 Defect of a tree... 69 // 8. Partitioning graphs into perfect codes... 71 // Perfect codes in cartesian powers of graphs... 77 // 9. Some nonexistence results... 79 // 10. Second powers of self-complementary graphs... 87 // 11. Perfect codes in the second power of a random graph... 89 // 12. Perfect codes in the second powers of trees ... 92 // Final remarks and open problems... 114 // References... 123 // Резюме... 126 // 3
|
Dotazy a připomínky