Artículos relacionados a Transfiniteness: For Graphs, Electrical Networks, and...
Sinopsis
"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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
"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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialBirkhäuser
- Año de publicación1996
- ISBN 10 0817638180
- ISBN 13 9780817638184
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas260
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 10,04
EUR 12,57 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Transfiniteness: For Graphs, Electrical Networks, and...
Imagen de archivo
Transfiniteness: For Graphs, Electrical Networks, and Random Walks
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: New. Nº de ref. del artículo: mon0003624873
Cantidad disponible: 1 disponibles
Imagen de archivo
Transfiniteness : For Graphs, Electrical Networks, and Random Walks
Publicado por
Birkhäuser Boston, 1996
ISBN 10: 0817638180
ISBN 13: 9780817638184
Antiguo o usado
Tapa dura
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Seiten: 260 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 1804678/2
Cantidad disponible: 1 disponibles
Imagen de archivo
Transfiniteness For Graphs , Electrical Networks , And Random Walks
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABNR-77315
Cantidad disponible: 5 disponibles
Imagen de archivo
Transfiniteness
Librería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 260 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Nº de ref. del artículo: 7422857
Cantidad disponible: 4 disponibles
Imagen de archivo
Transfiniteness
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 260. Nº de ref. del artículo: 26457814
Cantidad disponible: 4 disponibles
Imagen de archivo
Transfiniteness
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. pp. 260. Nº de ref. del artículo: 18457820
Cantidad disponible: 4 disponibles
Imagen de archivo
Transfiniteness: For Graphs, Electrical Networks, and Random Walks
Librería: BOOKWEST, Phoenix, AZ, Estados Unidos de America
Calificación del vendedor: 2 de 5 estrellas
Hardcover. Condición: New. SHIPS FROM USA. Nº de ref. del artículo: SR-100D1-105B3-110C5-0817638180
Cantidad disponible: 1 disponibles
Imagen de archivo
Transfiniteness For Graphs Electrical Networks And Random Walks
Publicado por
Birkhauser, Boston, 1996
ISBN 10: 0817638180
ISBN 13: 9780817638184
Nuevo
Tapa dura
Original o primera edición
Librería: Pegasus Books, Farmington Hills, MI, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: New. First Edition. Cover is plum colored with white lettering on front and spine. This is a NEW book, still in the publisher's shrinkwrap. Transfiniteness introduces radically new constructs and expands graphs and their related topics far beyond their conventional domains. ; 6 1/4 x 9 1/2; 246 pages; New. Nº de ref. del artículo: 1706
Cantidad disponible: 1 disponibles
Imagen de archivo
Transfiniteness For Graphs , Electrical Networks , And Random Walks
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJUNE24-129859
Cantidad disponible: 17 disponibles
Imagen del vendedor
Transfiniteness
Publicado por
Birkhäuser Boston, Birkhäuser Boston Jan 1996, 1996
ISBN 10: 0817638180
ISBN 13: 9780817638184
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -'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. 260 pp. Englisch. Nº de ref. del artículo: 9780817638184
Cantidad disponible: 2 disponibles