Ordinal Distances in Transfinite Graphs

Armen H. Zemanian
Additional contact information
Armen H. Zemanian: State University of New York at Stony Brook, Department of Electrical Engineering

Chapter 4 in Graphs and Networks, 2004, pp 39-62 from Springer

Abstract: Abstract The idea of distances in connected finite graphs has been quite fruitful, with much research directed toward both theory and applications. See, for example, [8], [9], [14] and the references therein. Such distances are given by a metric that assigns to each pair of nodes the minimum number of branches for all the paths connecting those two nodes. Thus, the metric takes its values in the set 1Zo if natural numbers. The objective in this chapter is to extend that metric to connected transfinite graphs and then to establish several transfinite generalizations of distance-related facts about finite graphs. This requires that our distance metric now take its values in the set R of all countable ordinals.

Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-8176-8178-4_4

Ordering information: This item can be ordered from
http://www.springer.com/9780817681784

DOI: 10.1007/978-0-8176-8178-4_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().