AMBIENTUM BIOETHICA BIOLOGIA CHEMIA DIGITALIA DRAMATICA EDUCATIO ARTIS GYMNAST. ENGINEERING EPHEMERIDES EUROPAEA GEOGRAPHIA GEOLOGIA HISTORIA HISTORIA ARTIUM INFORMATICA IURISPRUDENTIA MATHEMATICA MUSICA NEGOTIA OECONOMICA PHILOLOGIA PHILOSOPHIA PHYSICA POLITICA PSYCHOLOGIA-PAEDAGOGIA SOCIOLOGIA THEOLOGIA CATHOLICA THEOLOGIA CATHOLICA LATIN THEOLOGIA GR.-CATH. VARAD THEOLOGIA ORTHODOXA THEOLOGIA REF. TRANSYLVAN
|
|||||||
Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului. |
|||||||
STUDIA INFORMATICA - Ediţia nr.1 din 2013 | |||||||
Articol: |
A GOOD DRAWING OF COMPLETE BIPARTITE GRAPH K9;9, WHOSE CROSSING NUMBER HOLDS ZARANKIEWICZ CONJECTURES. Autori: . |
||||||
Rezumat: 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. |
|||||||