Skip to main content
Birkhäuser

Transfiniteness

For Graphs, Electrical Networks, and Random Walks

  • Book
  • © 1996

Overview

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

Keywords

About this book

"What good is a newborn baby?" Michael Faraday's reputed response when asked, "What good is magnetic induction?" But, it must be admitted that a newborn baby may die in infancy. What about this one- the idea of transfiniteness for graphs, electrical networks, and random walks? At least its bloodline is robust. Those subjects, along with Cantor's transfinite numbers, comprise its ancestry. There seems to be general agreement that the theory of graphs was born when Leonhard Euler published his solution to the "Konigsberg bridge prob­ lem" in 1736 [8]. Similarly, the year of birth for electrical network theory might well be taken to be 184 7, when Gustav Kirchhoff published his volt­ age and current laws [ 14]. Ever since those dates until just a few years ago, all infinite undirected graphs and networks had an inviolate property: Two branches either were connected through a finite path or were not connected at all. The idea of two branches being connected only through transfinite paths,that is, only through paths having infinitely many branches was never invoked, or so it appears from a perusal of various surveys of infinite graphs [17], [20], [29], [32]. Our objective herein is to explore this idea and some of its ramifications. It should be noted however that directed graphs having transfinite paths have appeared in set theory [6, Section 4.

Authors and Affiliations

  • Department of Electrical Engineering, State University of New York at Stony Brook, Stony Brook, USA

    Armen H. Zemanian

Bibliographic Information

  • Book Title: Transfiniteness

  • Book Subtitle: For Graphs, Electrical Networks, and Random Walks

  • Authors: Armen H. Zemanian

  • DOI: https://doi.org/10.1007/978-1-4612-0767-2

  • Publisher: Birkhäuser Boston, MA

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1996

  • Hardcover ISBN: 978-0-8176-3818-4Published: 01 January 1996

  • Softcover ISBN: 978-1-4612-6894-9Published: 26 June 2013

  • eBook ISBN: 978-1-4612-0767-2Published: 29 June 2013

  • Edition Number: 1

  • Number of Pages: X, 246

  • Topics: Mathematical Modeling and Industrial Mathematics, Communications Engineering, Networks

Publish with us