Student Work
Distance Labelings of Möbius Ladders
公开可下载的内容
open in viewerThe λ(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
- Publisher
- Identifier
- E-project-031213-120107
- Advisor
- Year
- 2013
- Date created
- 2013-03-12
- Resource type
- Major
- Rights statement
关系
- 属于 Collection:
项目
Permanent link to this page: https://digital.wpi.edu/show/7m01bn32j