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...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphovsmän: Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan, George L. Rudolph
Materialtyp: Artigo
Språk:Inglês
Publicerad: Taylor & Francis Group 2016-04-01
Serie:AKCE International Journal of Graphs and Combinatorics
Ämnen:
k-ranking
Directed path
Directed cycle
Adjacency matrix
Sierpinski triangle
Länkar:http://www.sciencedirect.com/science/article/pii/S0972860015300384
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!

Liknande verk