Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs

L.Chia, Gek; L.Lee, Chan

Abstract

References

Ars Combinatoria

Volume 121
Pages: 437-446

Research article

Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs

^¹,², ^³

¹Department of Mathematical and Actuarial Sciences, Universiti Tunku Abdul Rahman, Jalan Genting Kelang, 53300 Setapak, Kuala Lumpur, Malaysia

²Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur, Malaysia

³NUS High School of Maths. & Science, 20 Clementi Avenue 1, Singapore, 129957

Published: 31/07/2015

Download PDF
Cite

Copyright Link
License

Abstract

We determine the crossing numbers (i) of the complete graph $K_{n}$ with an edge deleted for $n \leq 12$ and (ii) of the complete bipartite graph $K_{m, n}$ with an edge deleted for $m \in {3, 4}$ and for all natural numbers $n $$ , and also for the case $m = n = 5$ .

Contents

Ars Combinatoria

Crossing Numbers of Nearly Complete Graphs and Nearly Complete Bipartite Graphs

Abstract

Information

Guidelines

CP Initiatives

Follow CP