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

Walk-Based Transfinite Graphs and Networks

In: Graphs and Networks

Author

Listed:
  • Armen H. Zemanian

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

Abstract

The theory of transfinite graphs developed so far has been based on the ideas that connectedness is accomplished through paths and that the infinite extremities of the graph are specified through equivalence classes of one-ended paths. This is a natural extension of finite graphs because connectedness for finite graphs is fully characterized by paths; indeed, any walk terminating at two nodes of a finite graph contains a path doing the same. However, such is no longer the case for transfinite graphs. Indeed, path-connectedness need not be transitive as a binary relationship among transfinite nodes, and Condition 3.1-2 was imposed to ensure such transitivity. Without that condition, distances as defined by paths do not exist between certain pairs of nonsingleton nodes. This limitation is also reflected in the theory of transfinite electrical networks by the fact that node voltages need not be uniquely determined when they are defined along paths to a chosen ground node.

Suggested Citation

  • Armen H. Zemanian, 2004. "Walk-Based Transfinite Graphs and Networks," Springer Books, in: Graphs and Networks, chapter 5, pages 63-97, Springer.
    • Handle: RePEc:spr:sprchp:978-0-8176-8178-4_5
    DOI: 10.1007/978-0-8176-8178-4_5
    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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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_5. 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.