The bandwidth of the tower graph Tm,2k

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Conference Proceeding

Source Title

Proceedings of the Eleventh OU-DLSU Academic Research Workshop

First Page

70

Last Page

72

Publication Date

9-2008

Abstract

The bandwidth problem for a graph is that of labeling its vertices with distinct integers so that the maximum difference across an edge is minimized. In this study, the bandwidth of a tower graph Tm,n is investigated when n is even. A tower graph Tm,n is a block graph such that the following are satisfied:

  • Each clique is either a complete graph Km or P2
  • Deleting the leaves will produce the cartesian product Km x Pn
  • Each Km has m leaves

html

Disciplines

Mathematics

Keywords

Graph labelings; Graph theory

Upload File

wf_no

This document is currently not available here.

Share

COinS