Ordinal Distances in Transfinite Graphs
| dc.creator | Zemanian, A. H. | |
| dc.date | 2002-09-11 | |
| dc.date.accessioned | 2026-07-07T04:50:46Z | |
| dc.date.available | 2026-07-07T04:50:46Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0209128 | |
| dc.identifier | http://arxiv.org/abs/math/0209128 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/64913 | |
| dc.subject | Combinatorics | |
| dc.title | Ordinal Distances in Transfinite Graphs | |
| dc.type | text |