| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648900 | Discrete Mathematics | 2010 | 10 Pages |
Abstract
A ranking of a graph is a labeling of the vertices with positive integers such that any path between vertices of the same label contains a vertex of greater label. The rank number of a graph is the smallest possible number of labels in a ranking. We find rank numbers of the Möbius ladder, Ks×PnKs×Pn, and P3×PnP3×Pn. We also find bounds for rank numbers of general grid graphs Pm×PnPm×Pn.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hannah Alpert,