Covering Walks in Graphs (Paperback, 2014 ed.)

Futaba Fujie, Ping Zhang

Series: SpringerBriefs in Mathematics

(sign in to rate)

Loot Price R1,870 Discovery Miles 18 700 | Repayment Terms: R175 pm x 12*

Expected to ship within 10 - 15 working days

Description
Details
Customer Reviews

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.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	SpringerBriefs in Mathematics
Release date:	2014
First published:	2014
Authors:	Futaba Fujie • Ping Zhang
Dimensions:	235 x 155 x 8mm (L x W x T)
Format:	Paperback
Pages:	110
Edition:	2014 ed.
ISBN-13:	978-1-4939-0304-7
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Applied mathematics > General Promotions
LSN:	1-4939-0304-7
Barcode:	9781493903047