Contact
How to shop
Delivery
Shopping guide
Transfiniteness for Graphs, Electrical Networks, and Random Walks
English
111 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Paperback
10.59
€
/
Hardback
13.79
€
/
Paperback
11.75
€
/
Hardback
199.95
€
/
Hardback
180.00
€
/
Paperback
54.90
€
/
Hardback
34.95
€
"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.
About the book
English
Categories
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
8.69
€
/
Hardback
271.79
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?