Geodesic
Perfect codes in the graphs Ok and L(Ok)
Glasgow mathematical journal, Tome 21 (1980) no. 1, pp. 169-172

Voir la notice de l'article provenant de la source Cambridge University Press

In [6] the question of the existence of perfect e-codes in the infinite family of distance-transitive graphs Ok was considered. It was pointed out that it is difficult to rule out completely any particular value of e because of the difficulty of working with the sphere packing condition. For e= 1, 2, 3 it can be seen from the results of [6] that the condition given by the generalisation of Lloyd's theorem is satisfied for infinitely many values of k. We shall show that this is not the case for e=4 and we shall prove that there are no perfect 4-codes in Ok. 
Smith, D. H. Perfect codes in the graphs Ok and L(Ok). Glasgow mathematical journal, Tome 21 (1980) no. 1, pp. 169-172. doi: 10.1017/S0017089500004146
@article{10_1017_S0017089500004146,
     author = {Smith, D. H.},
     title = {Perfect codes in the graphs {Ok} and {L(Ok)}},
     journal = {Glasgow mathematical journal},
     pages = {169--172},
     year = {1980},
     volume = {21},
     number = {1},
     doi = {10.1017/S0017089500004146},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004146/}
}
TY  - JOUR
AU  - Smith, D. H.
TI  - Perfect codes in the graphs Ok and L(Ok)
JO  - Glasgow mathematical journal
PY  - 1980
SP  - 169
EP  - 172
VL  - 21
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004146/
DO  - 10.1017/S0017089500004146
ID  - 10_1017_S0017089500004146
ER  - 
%0 Journal Article
%A Smith, D. H.
%T Perfect codes in the graphs Ok and L(Ok)
%J Glasgow mathematical journal
%D 1980
%P 169-172
%V 21
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089500004146/
%R 10.1017/S0017089500004146
%F 10_1017_S0017089500004146

[1] 1.Baker, A. and Davenport, H., The equations 3x2–2=y2 and 8x2–7=z2, Quart. J. Math. Oxford (2), 20 (1969), 129–137. Google Scholar | DOI

[2] 2.Biggs, N. L., Algebraic Graph Theory Cambridge Math. Tracts No. 67, (Cambridge University Press, London, 1974). Google Scholar | DOI

[3] 3.Biggs, N. L., Perfect codes and distance-transitive graphs, in ”Combinatorics” (Proceedings of the British Combinatorial Conference, 1973) (Cambridge University Press, London/New York 1974), 1–8. Google Scholar

[4] 4.Biggs, N. L., Perfect codes in graphs, J. Combinatorial Theory, Ser. B 15 (1973), 289–296. Google Scholar | DOI

[5] 5.Hammond, P., q-coverings, codes and line graphs (to appear). Google Scholar

[6] 6.Hammond, P. and Smith, D. H., Perfect codes in the graphs O J. Combinatorial Theory, Ser. B 19 (1975), 239–255. Google Scholar | DOI

Cité par Sources :