On total and entire weightings of plane graphs and some special classes of graphs

Date of Publication

2016

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics with specialization in Business Applications

Subject Categories

Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

This study discusses some results on entire weightings of plane graphs which induce proper vertex or proper face colorings. Specifically, entire weightings of 2-connected plane graphs are studied, and the minimum number of weights that make possible these proper vertex or face colorings are identified. This study also looks at total weightings of some classes of graphs which induce a proper vertex coloring. In particular, the minimum number of weights that can be used to generate a proper vertex coloring and graphs which admit a proper vertex coloring total weighting that uses at most two weights will be investigated. Most of the results in this paper are based on [12] and [16].

Abstract Format

html

Language

English

Format

Electronic

Accession Number

CDTU021078

Shelf Location

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

Physical Description

1 computer disc ; 4 3/4 in.

Keywords

Graph theory

Embargo Period

5-11-2021

This document is currently not available here.

Share

COinS