Book Description

Discrete Mathematics is one of the fastest growing areas in mathematics today with an ever-increasing number of courses in schools and universities. Graphs and Applications is based on a highly successful Open University course and the authors have paid particular attention to the presentation, clarity and arrangement of the material, making it ideally suited for independent study and classroom use. An important part of learning graph theory is problem solving; for this reason large numbers of examples, problems (with full solutions) and exercises (without solutions) are included. Accompanying the book is a CD-ROM comprising a Graphs Database, containing all the simple unlabelled graphs with up to seven vertices, and a Graphs Editor that enables students to construct and manipulate graphs. Both the Database and Editor are simple to use and allow students to investigate graphs with ease. Computing Notes and suggested activities are provided. ... Read more

Book Description

This book uses graphics calculator to explore new ideas which are validated by algebraic methods. Includes step by step directions and photos to ease the reader into graphics calculator usage techniques. ... Read more

Book Description

For a full description, see LaTorre et al., Calculus Concepts: An Informal Approach to the Mathematics of Change, 2/e.

Reviews (1)

If this is "Informal", I'd hate to see what "Formal" is.
Instead of actually showing any handy numerical processes used to figure out problems, this book tries to tell you via overly-wordy and remarkably garbled explanations in the middle of "real world" situations gathered from statistics. The authors' idea of "Informal" apparently means burying explanations under useless jargon. If you want to pass a Calculus class and don't already have a talent for mathematics, this is not the book to use. Use something that's straight to the point and ditch the "Informal Approach". ... Read more

Book Description

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors: Ronald L. Graham, Jan Karel Lenstra, and Robert E. Tarjan Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the ever-increasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record of the extraordinary development of this field. A complete listing of the titles in the Series appears on the inside front cover of this book. Recent titles in the Series include: Integer and Combinatorial Optimization George L. Nemhauser and Laurence A. Wolsey "[Integer and Combinatorial Optimization] is a major contribution to the literature of discrete programming. This text should be required reading for anybody who intends to research this area or even just to keep abreast of developments." —Times Higher Education Supplement, London "An extensive but extremely well-written graduate text covering integer programming." —American Mathematical Monthly 1988 (0 471-82819-X) 763 pp. Introduction to the Theory of Error-Correcting Codes Second Edition Vera Pless For mathematicians, engineers, and computer scientists, here is an introduction to the theory of error-correcting codes, focusing on linear block codes. The book considers such codes as Hamming and Golay codes, correction of double errors, use of finite fields, cyclic codes, B.C.H. codes, weight distributions, and design of codes. In a second edition of the book, Pless offers thoroughly expanded coverage of nonbinary and cyclic codes. Some proofs have been simplified, and there are many more examples and problems. 1989 (0 471-61884-5) 224 pp. ... Read more

Reviews (1)

bsmith review
very good book for learning algebra or mat 191. ... Read more

Book Description

This introductory book treats algorithmic graph theory specifically for programmers. It explores some key ideas and basic algorithms in this large and rapidly growing field, and contains high-level and language-independent descriptions of methods and algorithms on trees, the most important type of graphs in programming and informatics. Readers are assumed to be familiar with the basics of graph theory, and programming.Audience: This volume will be of interest to researchers and specialists in programming, software engineering, data structure and information retrieval, and to mathematicians whose work involves algorithms, combinatorics, graph theory, operations research, and discrete optimization. The book can also be recommended as a text for graduate courses in computer science, electronics, telecommunications, and control engineering. ... Read more

Book Description

This is the first book to offer a complete account of the theory of simplicial decompositions of graphs, possibly the single most important tool in infinite graph theory.The text is centered on a number of guiding problems and concepts such as the existence and uniqueness problem of simplicial decompositions into primes, and the concept of excluded minors as a means of identifying a desired structure. Following theoretical developments since the 1930s, the author includes extensive information on the current state of research, as well as many examples, proof strategies, exercises, and ongoing problems.The book will be a useful resource for graph theorists and mathematicians, and its lively account of important research will interest advanced students as well. ... Read more

Book Description

For college algebra courses in which graphing technology plays an integral role, College Algebra: A Graphing Approach, 3/e, is the undisputed leader in the field. The text's unparalleled exercises, motivating real-life applications, cutting-edge design, and innovative ancillaries and technology resources make it the most comprehensive program available.

• Interactive College Algebra: A Graphing Approach 2.0 CD-ROM provides detailed solutions to every odd exercise in the text, self-assessment testing, a built-in Meridian Graphing Calculator Emulator, animations, video clips, simulations and editable graphs, and the entire contents of the text. For those who prefer a web-based program, Internet College Algebra: A Graphing Approach 1.0 is an interactive text-specific subscription web site offering all of the above features plus opportunities for interaction online with peers and instructors.

Book Description

Graph Separators with Applications is devoted to techniques for obtaining upper and lower bounds on the sizes of graph separators -- upper bounds being obtained via decomposition algorithms. The book surveys the main approaches to obtaining good graph separations, while the main focus of the book is on techniques for deriving lower bounds on the sizes of graph separators. This asymmetry in focus reflects our perception that the work on upper bounds, or algorithms, for graph separation is much better represented in the standard theory literature than is the work on lower bounds, which we perceive as being much more scattered throughout the literature on application areas. Given the multitude of notions of graph separator that have been developed and studied over the past (roughly) three decades, there is a need for a central, theory-oriented repository for the mass of results. The need is absolutely critical in the area of lower-bound techniques for graph separators, since these techniques have virtually never appeared in articles having the word `separator' or any of its near-synonyms in the title. Graph Separators with Applications fills this need. ... Read more

Book Description

Among the simplest combinatorial designs, triple systems have diverse applications in coding theory, cryptography, computer science, and statistics. This book provides a systematic and comprehensive treatment of this rich area of mathematics. ... Read more

Book Description

The theory of perfect graphs was born out of a conjecture about graph colouring made by Claude Berge in 1960. That conjecture remains unsolved, but has generated an important area of research in combinatorics. This book:

• Includes an introduction by Claude Berge, the founder of perfect graph theory

• Discusses the most recent developments in the field of perfect graph theory

• Provides a thorough historical overview of the subject

• Internationally respected authors highlight the new directions, seminal results and the links the field has with other subjects

• Discusses how semi-definite programming evolved out of perfect graph theory

Book Description

This book is a collection of 16 state-of-the-art articles contributed by the most influential experts in the field of Steiner tree applications. The articles are designed to explore the impact on industries of the long-term theoretical development of Steiner tree problems. The authors address various Steiner tree problems originating from and applied to industry fields, such as the design of electronic circuits, telecommunication networks, computer networks, and computer biology. This book is a good reference tool for scientists who depend on Steiner tree problems in some way.Audience: Researchers in computer science, mathematics, and electrical engineering, as well as students. This book is suitable for both specialists and uniformed readers. ... Read more

Book Description

The first chapter of this book provides a brief treatment of the basics of the subject. The other chapters deal with the various decompositions of non-negative matrices, Birkhoff type theorems, the study of the powers of non-negative matrices, applications of matrix methods to other combinatorial problems, and applications of combinatorial methods to matrix problems and linear algebra problems.

The coverage of prerequisites has been kept to a minimum. Nevertheless, the book is basically self-contained (an Appendix provides the necessary background in linear algebra, graph theory and combinatorics). There are many exercises, all of which are accompanied by sketched solutions.Audience: The book is suitable for a graduate course as well as being an excellent reference and a valuable resource for mathematicians working in the area of combinatorial matrix theory. ... Read more

Book Description

A comprehensive summary of new and existing approaches to analyzing multiresponse data, Graphical Analysis of Multiresponse Data emphasizes graphical procedures. These procedures are then used, in various ways, to analyze, summarize, and present data from a specific, well-known plant breeding trial.These procedures result in overlap plots, their corresponding semigraphical tables, scatter plot matrices, profiles across environments and attributes for individual genotypes and groups of genotypes, and principal components.The interpretation of these displays, as an aid to understanding, is illustrated and discussed. Techniques for choosing expressions for the observed quantities are also emphasized.Graphical Analysis of Multiresponse Data is arranged into three parts:oWhat can usefully be doneoConsequences for the exampleoApproaches and choices in more detailThat structure enables the reader to obtain an overview of what can be found, and to then delve into various aspects more deeply if desired. Statisticians, data analysts, biometricians, plant breeders, behavioral scientists, social scientists, and engineering scientists will find Graphical Analysis of Multiresponse Data offers invaluable assistance. Its details are also of interest to scientists in private firms, government institutions, and research organizations who are concerned with the analysis and interpretation of experimental multiresponse data. ... Read more