IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-8176-8178-4_4.html
   My bibliography  Save this book chapter

Ordinal Distances in Transfinite Graphs

In: Graphs and Networks

Author

Listed:
  • Armen H. Zemanian

    (State University of New York at Stony Brook, Department of Electrical Engineering)

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.

Suggested Citation

  • Armen H. Zemanian, 2004. "Ordinal Distances in Transfinite Graphs," Springer Books, in: Graphs and Networks, chapter 4, pages 39-62, Springer.
    • Handle: RePEc:spr:sprchp:978-0-8176-8178-4_4
    DOI: 10.1007/978-0-8176-8178-4_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-8176-8178-4_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.