Faculty Advisor

Christopher, Peter R.

Abstract

The λ¬{2,1} number of a graph G is the largest number assigned to some vertex in an optimally (2,1)-labeled network. We examine the λ¬(2,1) number for Möbius ladders, originally defined by Richard Guy and Frank Harary. We determine the λ¬(2,1) number for even Möbius ladders and a subclass of odd Möbius ladders. In the remaining cases of odd Möbius ladders, we greatly improve the previously known upper bound for the λ¬(2,1) number for general graphs.

Publisher

Worcester Polytechnic Institute

Date Accepted

March 2013

Major

Mathematical Sciences

Project Type

Major Qualifying Project

Accessibility

Unrestricted

Advisor Department

Mathematical Sciences

Share

COinS