Date of Publication

2006

Document Type

Master's Thesis

Degree Name

Master of Science in Mathematics

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Thesis Adviser

Severino V. Gervacio

Defense Panel Chair

Leonor A. Ruivivar

Defense Panel Member

Yvette F. Lim
Bladimir C. Ocampo

Abstract/Summary

Every connected graph folds onto some complete graph which is not necessarily unique. It is known that if p is the chromatic number of a connected graph G then G folds onto Kp and to no other smaller complete graphs. On the other hand, the largest complete graph onto which a connected graph folds is not known. We shall give here some results about the largest complete graph onto which a connected graph folds. In particular, we shall consider the sum, Cartesian product, and composition of graphs.

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTG004176

Shelf Location

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

Physical Description

viii, 51 leaves, 28 cm. ; Typescript

Keywords

Mathematics; Graph theory; Mathematics -- graph theory -- Cartesian product of graphs

Upload Full Text

wf_yes

Download

Share

COinS