Abstract

In an $L(h,k)$ labeling of a graph $G$ we assign non-negative integers to the vertices of the graph such that the labels of the vertices that are at a distance of one have a difference of at least $h$ and the labels of the vertices which are at a distance of two have a difference of at least $k$. The aim in general is to minimize the $L(h,k)$ span, where the $L(h,k)$ span is the difference between highest and lowest label used. In this thesis we analyze $L(h,k)$ labelings of Cartesian products of complete graphs and path. For $h \geq k$ we establish the minimum $L(h,k)$ span of these graphs. For $h

Publication Date

2-8-2017

Document Type

Thesis

Student Type

Graduate

Department, Program, or Center

School of Mathematical Sciences (COS)

Advisor

Bonnie C. Jacob

Advisor/Committee Member

Jobby Jacob

Advisor/Committee Member

Baasansuren Jadamba

Campus

RIT – Main Campus

Share

COinS