论文信息 - Isometric embeddings in Hamming graphs

Isometric embeddings in Hamming graphs

Abstract An O ( n 3 )-algorithm is established which embeds a given graph isometrically into a Hamming graph (i.e., a cartesian product of complete graphs) whenever possible, and recognizes non-embeddable graphs. From the algorithm several characterizations of the embeddable graphs are derived.

Elke Wilkeit | Elke Wilkeit

[1] V. Firsov. Isometric embedding of a graph in a Boolean cube , 1965 .

[2] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.

[3] P. Erdös. On an extremal problem in graph theory , 1970 .

[4] Hans-Jürgen Bandelt,et al. Graphs with intrinsic s3 convexities , 1989, J. Graph Theory.

[5] H. M. Mulder. The interval function of a graph , 1980 .

[6] Andreas W. M. Dress,et al. Gated sets in metric spaces , 1987 .

[7] Michael Randolph Garey,et al. On cubical graphs , 1975 .

[8] R. Graham,et al. On isometric embeddings of graphs , 1985 .

[9] Ronald L. Graham,et al. On the addressing problem for loop switching , 1971 .

[10] Elke Wilkeit. Isometrische Untergraphen von Hamming-Graphen , 1986 .

[11] Peter Winkler,et al. Isometric embedding in products of complete graphs , 1984, Discret. Appl. Math..

[12] David Avis,et al. Hypermetric Spaces and the Hamming Cone , 1981, Canadian Journal of Mathematics.

[13] J. Moon,et al. On cliques in graphs , 1965 .

[14] A. J. Goldman,et al. Letter to the Editor---A Localization Theorem for Optimal Facility Placement , 1970 .

[15] Jarmila Hedlíková,et al. Ternary spaces, media, and Chebyshev sets , 1983 .

[16] D. Djoković. Distance-preserving subgraphs of hypercubes , 1973 .