Abstract
The first section, Sec. 3.1, is the more important one for this chapter. It defines the various ranks of connectedness for transfinite graphs, presents the critical Condition 3.1-2 that insures that connectedness is transitive, and shows how at each rank this partitions a transfinite graph into nonoverlapping subgraphs, called “sections.” Sec. 3.2 explains how a transfinite tree can be easily contracted to and expanded from a conventional tree. Sec. 3.3 relates the v-nodes and (y-1)-sections of a v-graph to a hypergraph and gives an example of how a result from hypergraph theory can be transferred to transfinite graph theory.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science+Business Media New York
About this chapter
Cite this chapter
Zemanian, A.H. (2004). Connectedness, Trees, and Hypergraphs. In: Graphs and Networks. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8178-4_3
Download citation
DOI: https://doi.org/10.1007/978-0-8176-8178-4_3
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-4292-1
Online ISBN: 978-0-8176-8178-4
eBook Packages: Springer Book Archive