Minimal rankings
β
Ghoshal, J.; Laskar, R.; Pillone, D.
π
Article
π
1996
π
John Wiley and Sons
π
English
β 711 KB
## A k-ranking, f , for a graph G is a function = f ( u ) , then every uu path contains a vertex w such that f ( w ) > f ( u ) . In this paper, we define minimal rankings of graphs. Properties of minimal rankings are established and then used to determine x,, the minimum ranking number, and &, the