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.

• This report represents the work of one or more WPI undergraduate students submitted to the faculty as evidence of completion of a degree requirement. WPI routinely publishes these reports on its website without editorial or peer review.

Creator

• Diaz, Kyle James
• Rojas, Anthony Charles

Publisher

• Worcester Polytechnic Institute

Identifier

• E-project-031213-120107

Advisor

• Christopher, Peter R.

Year

• 2013

Date created

• 2013-03-12

Resource type

• Major Qualifying Project

Major

• Mathematical Sciences

Rights statement

• In Copyright