Portal de Periódicos da CAPES

Rank numbers for bent ladders

2014; De Gruyter Open; Volume: 34; Issue: 2 Linguagem: Inglês

10.7151/dmgt.1739

2083-5892

Jobby Jacob, Darren A. Narayan, Péter Richter, Emily Sergel, Anh T. Tran,

Computational Geometry and Mesh Generation

A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label.The rank number of a graph is the fewest number of labels that can be used in a ranking.The rank number of a graph is known for many families, including the ladder graph P 2 × P n .We consider how "bending" a ladder affects the rank number.We prove that in certain cases the rank number does not change, and in others the rank number differs by only 1.We investigate the rank number of a ladder with an arbitrary number of bends.