On the Crossing Number of Generalized Fat Trees

The crossing number of a graph G is the minimum number of crossings of its edges among the drawings of G in the plane and is denoted by cr(G). Bhatt and Leighton proved that the crossing number of a network is closely related to the minimum layout area required for the implementation of the VLSI circuit for that network. In this paper, we find an upper bound for the crossing number of a special case of the generalized fat tree based on the underlying graph model found in the literature. We also improve this bound for a new drawing of the same structure. The proofs are based on the drawing rules introduced in this paper.

[1]  R. Guy.  Crossing numbers of graphs , 1972 .

[2]  Jerald A. Kabell,et al.  The crossing numbers of some generalized Petersen graphs. , 1981 .

[3]  Harold Neville Vazeille Temperley,et al.  Graph theory and applications , 1981 .

[4]  F. Thomas Leighton,et al.  Complexity Issues in VLSI , 1983 .

[5]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[6]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[7]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[8]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[9]  Ondrej Sýkora,et al.  On crossing numbers of hypercubes and cube connected cycles , 1993, BIT.

[10]  Mohan Kumar,et al.  On generalized fat trees , 1995, Proceedings of 9th International Parallel Processing Symposium.

[11]  R. Cimikowski.  Topological Properties of Some Interconnection Network Graphs. , 1996 .

[12]  R. Bruce Richter,et al.  RELATIONS BETWEEN CROSSING NUMBERS OF COMPLETE AND COMPLETE BIPARTITE GRAPHS , 1997 .

[13]  Gelasio Salazar,et al.  The Crossing Number of P(N, 3) , 2002, Graphs Comb..

[14]  Robert J. Cimikowski,et al.  Improved Bounds for the Crossing Number of the Mesh of Trees , 2003, J. Interconnect. Networks.

[15]  Nagi H. Nahas.  On the Crossing Number of K{m, n} , 2003, Electron. J. Comb..

[16]  László A. Székely.  A successful concept for measuring non-planarity of graphs: the crossing number , 2004, Discret. Math..

[17]  Frank Thomson Leighton,et al.  New lower bound techniques for VLSI , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[18]  Jason S. Williford,et al.  On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph , 2007 .

[19]  Shengjun Pan,et al.  The crossing number of K11 is 100 , 2007, J. Graph Theory.

[20]  Yang Yuansheng,et al.  On the Crossing Number of Km □ Pn , 2007 .