Research Article

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

by  Bharati Rajan, Indra Rajasingh, P.Vasanthi Beulah
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Issue 17
Published: April 2012
Authors: Bharati Rajan, Indra Rajasingh, P.Vasanthi Beulah
10.5120/6356-8782
PDF

Bharati Rajan, Indra Rajasingh, P.Vasanthi Beulah . Crossing Number of Join of Triangular Snake with mK1, Path and Cycle. International Journal of Computer Applications. 44, 17 (April 2012), 20-22. DOI=10.5120/6356-8782

                        @article{ 10.5120/6356-8782,
                        author  = { Bharati Rajan,Indra Rajasingh,P.Vasanthi Beulah },
                        title   = { Crossing Number of Join of Triangular Snake with mK1, Path and Cycle },
                        journal = { International Journal of Computer Applications },
                        year    = { 2012 },
                        volume  = { 44 },
                        number  = { 17 },
                        pages   = { 20-22 },
                        doi     = { 10.5120/6356-8782 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2012
                        %A Bharati Rajan
                        %A Indra Rajasingh
                        %A P.Vasanthi Beulah
                        %T Crossing Number of Join of Triangular Snake with mK1, Path and Cycle%T 
                        %J International Journal of Computer Applications
                        %V 44
                        %N 17
                        %P 20-22
                        %R 10.5120/6356-8782
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  • <ul style="text-align: justify;"> Bhatt, S. N. and Leighton, F. T. "A framework for solving VLSI graph layout problems", J. Comput. System Sci. 28 (1984), 300–343. Leighton, F. T. "New lower bound techniques for VLSI", Math. Systems Theory ,17 (1984), 47–70. Székely, L. A. "A Successful Concept for Measuring Nonplanarity of Graphs: the Crossing Number", Discrete Math. , 276 (2004), 331–352. Garey, M. R. and Johnson, D. S. "Crossing Number is NP–Complete", SIAM J. Alg. Disc. Meth,
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Drawing Of A Graph Crossing Number Union And Join Of Graphs Triangular Snake Path Cycle

Powered by PhDFocusTM