Articoli correlati a Covering Walks in Graphs
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
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)Contenuti
1. Eulerian Walks.- 2. Hamiltonian Walks.- 3. Traceable Walks.- References.- Index.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreSpringer
- Data di pubblicazione2014
- ISBN 10 1493903047
- ISBN 13 9781493903047
- RilegaturaCopertina flessibile
- LinguaInglese
- Numero di pagine124
- Contatto del produttorenon disponibile
Compra nuovo
Visualizza questo articolo
EUR 48,37
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Covering Walks in Graphs
Foto dell'editore
Covering Walks in Graphs (SpringerBriefs in Mathematics)
Da: BMV Bloor, Toronto, ON, Canada
Valutazione del venditore 5 su 5 stelle
Condizione: Very Good. Used - Very Good. Codice articolo 45-a- 00028
Quantità: 1 disponibili
Foto dell'editore
Covering Walks in Graphs
Da: Buchpark, Trebbin, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: Sehr gut. Zustand: Sehr gut | Seiten: 124 | Sprache: Englisch | Produktart: Bücher. Codice articolo 24473679/2
Quantità: 1 disponibili
Immagini fornite dal venditore
Covering Walks in Graphs
Editore:
Springer New York, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuovo
Kartoniert / Broschiert
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Kartoniert / Broschiert. Condizione: 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. Codice articolo 4213757
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Covering Walks in Graphs
Editore:
Springer New York Jan 2014, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781493903047
Quantità: 2 disponibili
Immagini fornite dal venditore
Covering Walks in Graphs
Editore:
Springer New York, Springer US Jan 2014, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Neuware -CoveringWalks 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 authorsprovide 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 124 pp. Englisch. Codice articolo 9781493903047
Quantità: 2 disponibili
Foto dell'editore
Covering Walks in Graphs (SpringerBriefs in Mathematics)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9781493903047_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Covering Walks in Graphs
Editore:
Springer New York, Springer US, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: 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. Codice articolo 9781493903047
Quantità: 1 disponibili
Foto dell'editore
COVERING WALKS IN GRAPHS
Editore:
Springer, New York, 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Antico o usato
Softcover
Da: Second Story Books, ABAA, Rockville, MD, U.S.A.
Valutazione del venditore 4 su 5 stelle
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. Codice articolo 1377325
Quantità: 1 disponibili
Foto dell'editore
Covering Walks in Graphs
Editore:
Springer-Verlag New York Inc., 2014
ISBN 10: 1493903047
ISBN 13: 9781493903047
Nuovo
Paperback / softback
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 280. Codice articolo C9781493903047
Quantità: Più di 20 disponibili
Foto dell'editore
Covering Walks in Graphs
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 5 su 5 stelle
PF. Condizione: New. Codice articolo 6666-IUK-9781493903047
Quantità: 10 disponibili