The bandwidth of tower graphs Tm,2 and Tm,3

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Dissertation

Publication Date

8-2007

Abstract

The bandwidth problem deals with finding a labeling of a graph G using non-negative integers such that the maximum difference between adjacent vertices is minimized. This thesis is a study on the bandwidth of tower graphs Tm,2 and Tm,3. Furthermore, some theorems and properties of bandwidth-critical subgraphs included in the paper entitled The bandwidth problem: Critical subgraphs and solution for caterpillars by Maciej Syslo and Jerzy Zak were proven and were used in the proofs for the bandwidth of tower graphs Tm,2 and Tm,3.

html

Disciplines

Mathematics

Keywords

Graph theory; Graph labelings

Upload File

wf_no

This document is currently not available here.

Share

COinS