Extrema property of the k-ranking of directed paths and cycles

A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such that every directed path connecting two vertices with the same label includes a vertex with a larger label in between. The rank number of   G is defined to be the smallest k such that G has a k-ranki...

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awduron: Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan, George L. Rudolph
Fformat: Artigo
Iaith:Inglês
Cyhoeddwyd: Taylor & Francis Group 2016-04-01
Cyfres:AKCE International Journal of Graphs and Combinatorics
Pynciau:
k-ranking
Directed path
Directed cycle
Adjacency matrix
Sierpinski triangle
Mynediad Ar-lein:http://www.sciencedirect.com/science/article/pii/S0972860015300384
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

Eitemau Tebyg