Refinement of Metrics: Erd\H{o}s Number, a Case Study
History and Overview
2019-09-02 v1 Combinatorics
Abstract
We introduce a concept called refinement and develop two different ways of refining metrics. By applying these methods we produce several refinements of the shortest-path distance on the collaboration graph and hence a couple new versions of the Erd\H{o}s number.
Keywords
Cite
@article{arxiv.1908.11681,
title = {Refinement of Metrics: Erd\H{o}s Number, a Case Study},
author = {K. Lock and W. Y. Pong and A. Wittmond},
journal= {arXiv preprint arXiv:1908.11681},
year = {2019}
}
Comments
13 pages, 3 figures, 2 tables