- Tytuł:
- Minimal rankings of the Cartesian product Kₙ ☐ Kₘ
- Autorzy:
-
Eyabi, Gilbert
Jacob, Jobby
Laskar, Renu
Narayan, Darren
Pillone, Dan - Powiązania:
- https://bibliotekanauki.pl/articles/743282.pdf
- Data publikacji:
- 2012
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph colorings
rankings of graphs
minimal rankings
rank number
arank number
Cartesian product of graphs
rook's graph - Opis:
- For a graph G = (V, E), a function f:V(G) → {1,2, ...,k} is a k-ranking if f(u) = f(v) implies that every u - v path contains a vertex w such that f(w) > f(u). A k-ranking is minimal if decreasing any label violates the definition of ranking. The arank number, $ψ_r(G)$, of G is the maximum value of k such that G has a minimal k-ranking. We completely determine the arank number of the Cartesian product Kₙ ☐ Kₙ, and we investigate the arank number of Kₙ ☐ Kₘ where n > m.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2012, 32, 4; 725-735
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł