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

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Main Authors: Breeanne Baker Swart, Rigoberto Flórez, Darren A. Narayan, George L. Rudolph
Format: Artigo
Sprog:Inglês
Udgivet: Taylor & Francis Group 2016-04-01
Serier:AKCE International Journal of Graphs and Combinatorics
Fag:
k-ranking
Directed path
Directed cycle
Adjacency matrix
Sierpinski triangle
Online adgang:http://www.sciencedirect.com/science/article/pii/S0972860015300384
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Lignende værker