लोड हो रहा है...
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 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|