You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Traces the eccentric life of legendary mathematician Paul Erdos, a wandering genius who fled his native Hungary during the Holocaust and helped devise the mathematical basis of computer science.
This is the first in a series of volumes, which provide an extensive overview of conjectures and open problems in graph theory. The readership of each volume is geared toward graduate students who may be searching for research ideas. However, the well-established mathematician will find the overall exposition engaging and enlightening. Each chapter, presented in a story-telling style, includes more than a simple collection of results on a particular topic. Each contribution conveys the history, evolution, and techniques used to solve the authors’ favorite conjectures and open problems, enhancing the reader’s overall comprehension and enthusiasm. The editors were inspired to create these ...
Graph Theory and Applications
In this volume which honors Professors W A Harris, Jr, M Iwano, Y Sibuya, active researchers from around the world report on their latest research results. Topics include Analytic Theory of Linear and Nonlinear Differential Equations, Asymptotic Expansions, Turning Points Theory, Special Functions, Delay Equations, Boundary Value Problems, Sturm-Liouville Eigenvalues, Periodic Solutions, Numerical Solutions and other areas of Applied Mathematics.
‘Network’ is a heavily overloaded term, so that ‘network analysis’ means different things to different people. Specific forms of network analysis are used in the study of diverse structures such as the Internet, interlocking directorates, transportation systems, epidemic spreading, metabolic pathways, the Web graph, electrical circuits, project plans, and so on. There is, however, a broad methodological foundation which is quickly becoming a prerequisite for researchers and practitioners working with network models. From a computer science perspective, network analysis is applied graph theory. Unlike standard graph theory books, the content of this book is organized according to methods for specific levels of analysis (element, group, network) rather than abstract concepts like paths, matchings, or spanning subgraphs. Its topics therefore range from vertex centrality to graph clustering and the evolution of scale-free networks. In 15 coherent chapters, this monograph-like tutorial book introduces and surveys the concepts and methods that drive network analysis, and is thus the first book to do so from a methodological perspective independent of specific application areas.
This book chronicles the Society's activities over fifty years, as membership grew, as publications became more numerous and diverse, as the number of meetings and conferences increased, and as services to the mathematical community expanded. To download free chapters of this book, click here.
Written by two prominent figures in the field, this comprehensive text provides a remarkably student-friendly approach. Its sound yet accessible treatment emphasizes the history of graph theory and offers unique examples and lucid proofs. 2004 edition.
Presenting the proceedings of the conference on Sturm-Liouville problems held in conjunction with the 26th Barrett Memorial Lecture Series at the University of Tennessee, Knoxville, this text covers both qualitative and computational theory of Sturm-Liouville problems. It surveys questions in the field as well as describing applications and concepts.