Transfinite Graphs

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

Chapter Chapter 2 in Transfiniteness, 1996, pp 19-46 from Springer

Abstract: Abstract Section 1.3 points toward our method for constructing transfinite graphs. Its most primitive concept is neither a node nor a branch but is instead an elementary tip. Nodes and branches are simply certain sets of such tips. Indeed, we may think of two elementary tips of a branch as being its two extremities. Then nodes are shorts between the extremities of different branches, and the result is a 0-graph.

Keywords: Terminal Node; Binary Sequence; Adjacent Node; Common Node; Horizontal Branch (search for similar items in EconPapers)
Date: 1996
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-1-4612-0767-2_2

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

DOI: 10.1007/978-1-4612-0767-2_2

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