On crossing numbers of some families of graphs

Date of Publication

1996

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

This paper is an exposition of two main results regarding the upper bounds of the crossing numbers of the Complete Graph Kp and Complete Bipartite Graph Kmn. Namely, (i) The crossing number of the complete graph Kp is less than or equal to 1/4/1/2p/1/2(p-1/1/2(p-2)/1/2(p-3), while(ii) The crossing number of the complete bipartite graph Kmn is bounded above by /1/2m/1/2(m-1)/1/2n/1/2(n-1).

Abstract Format

html

Language

English

Format

Print

Accession Number

TU07445

Shelf Location

Archives, The Learning Commons, 12F, Henry Sy Sr. Hall

Physical Description

43 leaves

Keywords

Graph theory; Numbers, Theory of

This document is currently not available here.

Share

COinS