Transfinite Graphs

  • Armen H. Zemanian


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.


Equivalence Class High Rank Terminal Node Adjacent Node Common Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Armen H. Zemanian
    • 1
  1. 1.Department of Electrical EngineeringState University of New York at Stony BrookStony BrookUSA

Personalised recommendations