Covering Walks in Graphs
2014. g. janv. · Springer Science & Business Media
E-grāmata
110
Lappuses
reportAtsauksmes un vērtējumi nav pārbaudīti. Uzzināt vairāk
Par šo e-grāmatu
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.
Novērtējiet šo e-grāmatu
Izsakiet savu viedokli!
Informācija lasīšanai
Viedtālruņi un planšetdatori
Instalējiet lietotni Google Play grāmatas Android ierīcēm un iPad planšetdatoriem/iPhone tālruņiem. Lietotne tiks automātiski sinhronizēta ar jūsu kontu un ļaus lasīt saturu tiešsaistē vai bezsaistē neatkarīgi no jūsu atrašanās vietas.
Klēpjdatori un galddatori
Varat klausīties pakalpojumā Google Play iegādātās audiogrāmatas, izmantojot datora tīmekļa pārlūkprogrammu.
E-lasītāji un citas ierīces
Lai lasītu grāmatas tādās elektroniskās tintes ierīcēs kā Kobo e-lasītāji, nepieciešams lejupielādēt failu un pārsūtīt to uz savu ierīci. Izpildiet palīdzības centrā sniegtos detalizētos norādījumus, lai pārsūtītu failus uz atbalstītiem e-lasītājiem.
