Vai al contenuto principale della pagina

Covering walks in graphs [[electronic resource] /] / by Futaba Fujie, Ping Zhang



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Fujie Futaba Visualizza persona
Titolo: Covering walks in graphs [[electronic resource] /] / by Futaba Fujie, Ping Zhang Visualizza cluster
Pubblicazione: New York, NY : , : Springer New York : , : Imprint : Springer, , 2014
Edizione: 1st ed. 2014.
Descrizione fisica: 1 online resource (123 p.)
Disciplina: 511.5
Soggetto topico: Graph theory
Combinatorics
Applied mathematics
Engineering mathematics
Graph Theory
Applications of Mathematics
Persona (resp. second.): ZhangPing
Note generali: Description based upon print version of record.
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 1. Eulerian Walks -- 2. Hamiltonian Walks -- 3. Traceable Walks -- References -- Index. .
Sommario/riassunto: 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.
Titolo autorizzato: Covering Walks in Graphs  Visualizza cluster
ISBN: 1-4939-0305-5
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910300141803321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: SpringerBriefs in Mathematics, . 2191-8198