Antibandwidth of Three-Dimensional Meshes

Electronic Notes in Discrete Mathematics

Volumn 28, Issue , 2007, Pages 161-167

  Török, Ľubomír ^a   Vrt'o, Imrich ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

antibandwidth; mesh; three dimensional

Indexed keywords

EID: 33847245454     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2007.01.023     Document Type: Article

References (18)

1. Bezrukov, S.L., Piotrowski, V.P., Shadows and isoperimetry in bipartite graphs, submitted
2. Bollobás B., and Leader I. Compressions and isoperimetric inequalities. Journal of Combinatorial Theory A 56 (1991) 47-62
3. Bollobás B., and Leader I. Matchings and paths in the cube. Discrete Applied Mathematics 75 (1997) 1-8
4. Cappanera, P., A survey on obnoxious facility location problems, Technical Report TR-99-11, Dipartimento di Informatica, Uni. di Pisa, 1999
5. Calmoneri T., Massini A., Torok L., and Vrt'o I. Anitbandwidth of complete k-ary trees. Electronic Notes in Discrete Mathematics 24 (2006) 259-266
6. Donnely S., and Isaak G. Hamiltonian powers in treshold and arborescent comparability graphs. Discrete Mathematics 202 (1999) 33-44
7. Díaz J., Petit J., and Serna M. A survey of graph layout problems. ACM Computing Surveys 34 (2002) 313-356
8. FitzGerald C.H. Optimal indexing of the vertices of graphs. Mathematics of Computation 28 127 (1974) 825-831
9. Gallian J.A. Graph labeling. Electronic Journal on Combinatorics (2005) DS6
10. Göbel F. The separation number. Ars Combinatoria 37 (1994) 262-274
11. Hale W.K. Frequency assignment: theory and applications. Proceedings of IEEE 60 (1980) 1497-1514
12. Isaak G. Powers of Hamiltonian paths in interval graphs. J. Graph Theory 28 (1998) 31-38
13. Leung J.Y.-T., Vornberger O., and Witthoff J.D. On some variants of the bandwidth minimization problem. SIAM J. Computing 13 (1984) 650-667
14. Yixun L., and JinJiang Y. The dual bandwidth problem for graphs. J. Zhengzhou Univ. Nat. Sci. Ed. 35 (2003) 1-5
15. Miller Z., and Pritikin D. On the separation number of a graph. NETWORKS 19 (1989) 651-666
16. Raspaud, A., Schröder, H., Sýkora, O., Török, L., Vrt'o, I., Antibandwidth and cyclic antibandwidth of meshes and hypercubes, submitted to Discrete Mathematics
17. Weili Y., Ju Z., and Xiaoxu L. Dual bandwidth of some special trees. J. Zhengzhou Univ. Nat. Sci. Ed. 35 (2003)
18. Ping Y. The separation numbers of two classes of graphs. J. Changsha Univ. Electr. Power Nat. Sci. Ed. 12 (1997) 421-426