论文信息 - A Short Proof of the Dilation of a Toroidal Mesh in a Path

A Short Proof of the Dilation of a Toroidal Mesh in a Path

Abstract We give a short proof that the dilation of an m × n toroidal mesh in an mn -vertex path equals 2 min[lcub] m, n [lcub], if m ≠ n and 2 n − 1, if m = n .

Mike Paterson | Heiko Schröder | Ondrej Sýkora | Imrich Vrto

[1] Carl H. FitzGerald. Optimal indexing of the vertices of graphs , 1974 .

[2] Burkhard Monien,et al. Embedding one interconnection network in another , 1990 .

[3] Jarmila Chvátalová,et al. Optimal labelling of a product of two paths , 1975, Discret. Math..

[4] J. L. Brenner. Labeling of Graphs , 1983 .

[5] L. H. Harper. Optimal numberings and isoperimetric problems on graphs , 1966 .

[6] Norman E. Gibbs,et al. The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[7] Bhagirath Narahari,et al. Optimal Embedding of 2-D Torus Into Ring , 1992, Inf. Process. Lett..

[8] Michael Stiebitz,et al. On the Bandwidth of Graph Products , 1992, Journal of Information Processing and Cybernetics.