Walk-Based Transfinite Graphs and Networks

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

Chapter 5 in Graphs and Networks, 2004, pp 63-97 from Springer

Abstract: 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.

Keywords: High Rank; Current Vector; Equivalence Relationship; Finite Graph; Node Voltage (search for similar items in EconPapers)
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_5

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

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

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 ().