Artículos relacionados a Covering Walks in Graphs (SpringerBriefs in Mathematics)
Sinopsis
Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Kӧnigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce interesting new results.
"Sinopsis" puede pertenecer a otra edición de este libro.
Críticas
From the book reviews:
“Fujie (Nagoya Univ., Japan) and Zhang (Western Michigan Univ.) broadly survey many similar statements, some theorems, and some conjectures in a manner clear enough for beginners and thorough enough for experts. ... Summing Up: Recommended. Upper-division undergraduates and above.” (D. V. Feldman, Choice, Vol. 52 (3), November, 2014)Reseña del editor
Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Kӧnigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce interesting new results.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2014
- ISBN 10 1493903047
- ISBN 13 9781493903047
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas124
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 59,56
EUR 4,65 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Covering Walks in Graphs (SpringerBriefs in Mathematics)
Imagen de archivo
Covering Walks in Graphs (SpringerBriefs in Mathematics)
Librería: BMV Bloor, Toronto, ON, Canada
Calificación del vendedor: 5 de 5 estrellas
Condición: Very Good. Used - Very Good. Nº de ref. del artículo: 45-a- 00028
Cantidad disponible: 1 disponibles
Imagen de archivo
Covering Walks in Graphs
Publicado por
Springer New York, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Seiten: 124 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 24473679/2
Cantidad disponible: 1 disponibles
Imagen de archivo
Covering Walks in Graphs (SpringerBriefs in Mathematics)
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9781493903047_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Covering Walks in Graphs
Publicado por
Springer New York Jan 2014, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Königsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce interesting new results. 124 pp. Englisch. Nº de ref. del artículo: 9781493903047
Cantidad disponible: 2 disponibles
Imagen del vendedor
Covering Walks in Graphs
Publicado por
Springer New York, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuevo
Kartoniert / Broschiert
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. a|Provides a comprehensive treatment on measures of Hamiltonicity and traversability in graphsContains intriguing open problems and conjectures on spanning walks in graphsDescribes new frame works for several well-known Hamiltonian concepts. Nº de ref. del artículo: 4213757
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Covering Walks in Graphs
Publicado por
Springer New York, Springer US, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Königsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in these problems. The concepts of different spanning walks with examples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described; in some cases, the authors provide proofs of these results to illustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers are introduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Hamiltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works for several well-known Hamiltonian concepts and produce interesting new results. Nº de ref. del artículo: 9781493903047
Cantidad disponible: 1 disponibles
Imagen de archivo
Covering Walks in Graphs
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9781493903047
Cantidad disponible: 10 disponibles
Imagen de archivo
COVERING WALKS IN GRAPHS
Publicado por
Springer, New York, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Antiguo o usado
Softcover
Librería: Second Story Books, ABAA, Rockville, MD, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Softcover. Octavo, 110 pages. In Very Good minus condition. Gray and blue spine with white text. Covers have mild shelf wear and slight bending to corners. Textblock clean. Shelved ND-E. 1377325. FP New Rockville Stock. Nº de ref. del artículo: 1377325
Cantidad disponible: 1 disponibles
Imagen de archivo
Covering Walks in Graphs
Publicado por
Springer-Verlag New York Inc., 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuevo
Paperback / softback
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 280. Nº de ref. del artículo: C9781493903047
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Covering Walks in Graphs
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. xiv + 110. Nº de ref. del artículo: 26127086789
Cantidad disponible: 4 disponibles