Overview
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (8 chapters)
Keywords
About this book
Reviews
"Transfinite graphs and networks have already been studied in two prior books by the same author. The purpose of the present volume is twofold. First, it is to include a variety of new results that have since been obtained. Second, it is to present a much simpler exposition of the subject. The previous works aimed at generality with a variety of difficulties resulting from the complexity of the subject. The present much simpler exposition sacrifices some generality, but captures the essential ideas of transfiniteness for graphs and networks.... Overall, the author has done excellent work in presenting this complex subject."
—Mathematical Reviews
"Transfiniteness is an abstract mathematical concept that is extended by the author to the very real world of graphs and networks and the idea of random walks, topics of particular interest to circuits and systems network research.... Mathematicians, operations researchers and electrical engineers, in particular, graph theorists, electrical circuit theorists, and probabalists will find an accessible exposition of an advanced subject."
—Zentralblatt MATH
Authors and Affiliations
Bibliographic Information
Book Title: Pristine Transfinite Graphs and Permissive Electrical Networks
Authors: Armen H. Zemanian
DOI: https://doi.org/10.1007/978-1-4612-0163-2
Publisher: Birkhäuser Boston, MA
-
eBook Packages: Springer Book Archive
Copyright Information: Birkhäuser Boston 2001
Hardcover ISBN: 978-0-8176-4194-8Published: 21 December 2000
Softcover ISBN: 978-1-4612-6641-9Published: 01 November 2012
eBook ISBN: 978-1-4612-0163-2Published: 06 December 2012
Edition Number: 1
Number of Pages: XI, 183
Topics: Discrete Mathematics, Electrical Engineering, Complexity, Control, Robotics, Mechatronics