Covering Walks in Graphs
Covering Walks in Graphs

Author: Futaba Fujie

Publisher: Springer Science & Business Media

Published: 2014-01-25

Total Pages: 123

ISBN-13: 1493903055

DOWNLOAD EBOOK

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.

Handbook of Graph Theory
Handbook of Graph Theory

Author: Jonathan L. Gross

Publisher: CRC Press

Published: 2013-12-17

Total Pages: 1606

ISBN-13: 1439880190

DOWNLOAD EBOOK

In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition-over 400 pages longer than its prede

Arc Routing
Arc Routing

Author: Moshe Dror

Publisher: Springer Science & Business Media

Published: 2000-08-31

Total Pages: 522

ISBN-13: 9780792378983

DOWNLOAD EBOOK

Arc Routing: Theory, Solutions and Applications is about arc traversal and the wide variety of arc routing problems, which has had its foundations in the modern graph theory work of Leonhard Euler. Arc routing methods and computation has become a fundamental optimization concept in operations research and has numerous applications in transportation, telecommunications, manufacturing, the Internet, and many other areas of modern life. The book draws from a variety of sources including the traveling salesman problem (TSP) and graph theory, which are used and studied by operations research, engineers, computer scientists, and mathematicians. In the last ten years or so, there has been extensive coverage of arc routing problems in the research literature, especially from a graph theory perspective; however, the field has not had the benefit of a uniform, systematic treatment. With this book, there is now a single volume that focuses on state-of-the-art exposition of arc routing problems, that explores its graph theoretical foundations, and that presents a number of solution methodologies in a variety of application settings. Moshe Dror has succeeded in working with an elite group of ARC routing scholars to develop the highest quality treatment of the current state-of-the-art in arc routing.

LATIN 2018: Theoretical Informatics
LATIN 2018: Theoretical Informatics

Author: Michael A. Bender

Publisher: Springer

Published: 2018-04-05

Total Pages: 904

ISBN-13: 3319774042

DOWNLOAD EBOOK

This book constitutes the proceedings of the 13th Latin American Symposium on Theoretical Informatics, LATIN 2018, held in Buenos Aires, Argentina, in April 2018. The 63 papers presented in this volume were carefully reviewed and selected from 161 submissions. The Symposium is devoted to different areas in theoretical computer science, including, but not limited to: algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

Graph Theory and Its Applications
Graph Theory and Its Applications

Author: Jonathan L. Gross

Publisher: CRC Press

Published: 2005-09-22

Total Pages: 799

ISBN-13: 1420057146

DOWNLOAD EBOOK

Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and abundance

Random Walks on Infinite Graphs and Groups
Random Walks on Infinite Graphs and Groups

Author: Wolfgang Woess

Publisher: Cambridge University Press

Published: 2000-02-13

Total Pages: 350

ISBN-13: 0521552923

DOWNLOAD EBOOK

The main theme of this book is the interplay between the behaviour of a class of stochastic processes (random walks) and discrete structure theory. The author considers Markov chains whose state space is equipped with the structure of an infinite, locally finite graph, or as a particular case, of a finitely generated group. The transition probabilities are assumed to be adapted to the underlying structure in some way that must be specified precisely in each case. From the probabilistic viewpoint, the question is what impact the particular type of structure has on various aspects of the behaviour of the random walk. Vice-versa, random walks may also be seen as useful tools for classifying, or at least describing the structure of graphs and groups. Links with spectral theory and discrete potential theory are also discussed. This book will be essential reading for all researchers working in stochastic process and related topics.

Research in Computational Molecular Biology
Research in Computational Molecular Biology

Author: Mona Singh

Publisher: Springer

Published: 2016-04-08

Total Pages: 303

ISBN-13: 3319319574

DOWNLOAD EBOOK

This book constitutes the proceedings of the 20th Annual Conference on Research in Computational Molecular Biology, RECOMB 2016, held in Santa Monica, CA, USA, in April 2016. The 15 regular papers presented in this volume were carefully reviewed and selected from 172 submissions. 20 short abstracts are included in the back matter of the volume. They report on original research in all areas of computational molecular biology and bioinformatics.