- Tytuł:
- Rank numbers for bent ladders
- Autorzy:
-
Richter, Peter
Leven, Emily
Tran, Anh
Ek, Bryan
Jacob, Jobby
Narayan, Darren A. - Powiązania:
- https://bibliotekanauki.pl/articles/30148235.pdf
- Data publikacji:
- 2014-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph colorings
rankings of graphs
rank number
Cartesian product of graphs
ladder graph
bent ladder graph - Opis:
- 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
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2014, 34, 2; 309-329
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł