Back to Search
Start Over
From rankings' collinearity to counting SDR's via chromatic list expression.
- Source :
-
International Journal of Computer Mathematics . Sep2009, Vol. 86 Issue 9, p1483-1489. 7p. 1 Diagram, 1 Chart. - Publication Year :
- 2009
-
Abstract
- The problem of counting rankings satisfying the collinearity condition with respect to two rankings over the metric spaces of rank distance is treated in this paper by transforming it into finding the number of systems of distinct representatives (abbreviated as SDR's) with respect to associated set systems. A formula for the chromatic list expression of graphs is then given in terms of the inclusion and exclusion principle, followed by a formula for the number of SDR's of set systems when the graphs are complete. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00207160
- Volume :
- 86
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- International Journal of Computer Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 43388995
- Full Text :
- https://doi.org/10.1080/00207160701828090