تحميل...
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...
محفوظ في:
المؤلفون الرئيسيون: | , , , |
---|---|
التنسيق: | Artigo |
اللغة: | Inglês |
منشور في: |
Taylor & Francis Group
2016-04-01
|
سلاسل: | AKCE International Journal of Graphs and Combinatorics |
الموضوعات: | |
الوصول للمادة أونلاين: | http://www.sciencedirect.com/science/article/pii/S0972860015300384 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|