Transfinite Graphs

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

Chapter 2 in Graphs and Networks, 2004, pp 5-22 from Springer

Abstract: Abstract In this chapter we define transfinite graphs and list a number of their properties. We shall be fairly concise, for most of what is presented herein has been discussed at some length in [51] along with a variety of illustrative examples.’ Our purpose here is to provide enough information to relieve the reader from any need to consult that prior work.

Keywords: Equivalence Class; High Rank; Terminal Node; Adjacent Node; Common Node (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_2

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

DOI: 10.1007/978-0-8176-8178-4_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 ().