Crossing Number of Join of Triangular Snake with mK1, Path and Cycle

The exact values of the crossing number is known only for a specific family of graphs. There are few results concerning crossing numbers of join of some graphs. We give the exact value of crossing number of the join of a certain graph G on with an empty graph, a path and a cycle respectively on m vertices. General Terms Computational Mathematics, Graph Theory.

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

[2]  Marián Klesc,et al.  The crossing numbers of join of the special graph on six vertices with path and cycle , 2010, Discret. Math..

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

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

[5]  Daniel J. Kleitman,et al.  The crossing number of K5,n , 1970 .

[6]  A. Sz ekely.  A successful concept for measuring non-planarity of graphs: the crossing number , 2007 .

[7]  Marián Klesc,et al.  The Crossing Numbers of Join of Paths and Cycles with Two Graphs of Order Five , 2011, MMCP.

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

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

[10]  HE Pei Ling,et al.  The Crossing Numbers of Cartesian Products of Stars and 5-Vertex Graphs , 2009 .

[11]  Xiaonian He,et al.  The Crossing Number of Cartesian Products of Stars with 5-Vertex Graphs , 2010, CI 2010.

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

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

[14]  Marián Klesc,et al.  The Join of Graphs and Crossing Numbers , 2007, Electron. Notes Discret. Math..

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

[16]  Bharati Rajan,et al.  Improved Bounds on the Crossing Number of Butterfly Network , 2013, Discret. Math. Theor. Comput. Sci..

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

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

[19]  Lowell W. Beineke,et al.  The crossing number of C3 × Cn , 1978, J. Comb. Theory, Ser. B.