Yüklüyor......
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...
Kaydedildi:
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Taylor & Francis Group
2016-04-01
|
| Seri Bilgileri: | AKCE International Journal of Graphs and Combinatorics |
| Konular: | |
| Online Erişim: | http://www.sciencedirect.com/science/article/pii/S0972860015300384 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|