Arankings of Trees
For a graph G = (V, E), a function f : V (G) → {1, 2, . . ., k} is a kranking for G if f(u) = f(v) implies that every u − v path contains a vertex w such that f(w) > f(u). A minimal k-ranking, f, of a graph, G, is a k-ranking with the property that decreasing the label of any vertex results in the r...
Na minha lista:
| Hovedforfatter: | |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
University of Zielona Góra
2019-05-01
|
| Serier: | Discussiones Mathematicae Graph Theory |
| Fag: | |
| Online adgang: | https://doi.org/10.7151/dmgt.2090 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|