Ordinal Distances in Transfinite Graphs
Combinatorics
2007-05-23 v1
Abstract
An ordinal-valued metric taking its values in the set of all countable ordinals can be assigned to a metrizable set of nodes in a transfinite graph. Then, a variety of results concerning nodal eccentricities, radii, diameters, centers, peripheries, and blocks can be extended to transfinite graphs.
Cite
@article{arxiv.math/0209128,
title = {Ordinal Distances in Transfinite Graphs},
author = {A. H. Zemanian},
journal= {arXiv preprint arXiv:math/0209128},
year = {2007}
}