Crossing numbers of complete bipartite graphs and complete graphs

Title

Crossing numbers of complete bipartite graphs and complete graphs

Creator

Hebbar S.; Mangam T.A.

Description

The crossing number of a graph is the smallest number of two edge crossings over all planar representations of the graph. In this paper, we investigate the crossing numbers of complete bipartite and complete graphs. Further, we identify optimal drawings and present results on crossing numbers of these classes of graphs. In addition, Zarankiewicz's conjecture on complete bipartite graphs and Guy's conjecture on complete graphs are verified to be true. 2018 Sanjith Hebbar, Tabitha Agnes Mangam.

Source

International Journal of Engineering and Technology(UAE), Vol-7, No. 4, pp. 2996-3000.

Date

2018-01-01

Publisher

Science Publishing Corporation Inc

Subject

68R10; Crossing number mathematics subject classifications: 05C62; Non-planar graphs; Planar graphs

Coverage

Hebbar S., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Mangam T.A., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India

Rights

Restricted Access

Relation

ISSN: 2227524X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.14419/ijet.v7i4.13682

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85057851670&doi=10.14419%2fijet.v7i4.13682&partnerID=40&md5=037080684661e4d87fae1590f6fbdc92