טוען...
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...
שמור ב:
| Main Authors: | , , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Taylor & Francis Group
2016-04-01
|
| סדרה: | AKCE International Journal of Graphs and Combinatorics |
| נושאים: | |
| גישה מקוונת: | http://www.sciencedirect.com/science/article/pii/S0972860015300384 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|