The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 1 / 2013  
         
  Article:   A GOOD DRAWING OF COMPLETE BIPARTITE GRAPH K9;9, WHOSE CROSSING NUMBER HOLDS ZARANKIEWICZ CONJECTURES.

Authors:  .
 
       
         
  Abstract:  

There exist some Drawing for any graph G = (V, E) on plan. An important aim in Graph Theory and Computer science is obtained a best drawing of an arbitrary graph. Also, a draw of a non-planar graph G on plan generate several edge-cross. A good drawing (or strongly best drawing) of G is consist of minimum edge-cross.The crossing number of a graph G, is the minimum number of crossings in a drawing of G in the plane, denoted by cr(G). A crossing is a point of intersection between two edges. The crossing number of the complete bipartite graph is one of the oldest crossing number open problems.

In this paper, we present a good drawing of complete bipartite

2010 Mathematics Subject Classifcation. 05C10, 05C35.

Key words and phrases. Complete graph, Complete bipartite graph, Crossing number, Best drawing.

 
         
     
         
         
      Back to previous page