Minimal rankings
β Scribed by Ghoshal, J.; Laskar, R.; Pillone, D.
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 711 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
β¦ Synopsis
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 maximum ranking number over all minimal rankings, for complete n-partite graphs and for split graphs.
π SIMILAR VOLUMES
The rank of an ordinary partition of a nonnegative integer n is the length of the main diagonal of its Ferrers or Young diagram. Nazarov and Tarasov gave a generalization of this definition for skew partitions and proved some basic properties. We show the close connection between the rank of a skew
This paper ranks academic institutions by publication activity in applied econometrics over the period 1989Β±1995. Fourteen leading international journals that publish applied econometrics articles are used to provide the database. The rankings are based on standardized page counts of articles publis
## Abstract Athletics may be influencing institutional rankingsβor it may not be.