o Home Page Last
Edited © 1999-2009 |
Graph Theory and Its Applications is a comprehensive applications-driven textbook that provides material for several different courses in graph theory. 1. INTRODUCTION to GRAPH MODELS
2. STRUCTURE and REPRESENTATION
3. TREES
4. SPANNING TREES
5. CONNECTIVITY
6. OPTIMAL GRAPH TRANSVERSALS
7. GRAPH OPERATIONS and MAPPINGS
8. DRAWING GRAPHS AND MAPS
9. PLANARITY OF GRAPHS
10. GRAPH COLORINGS
11. SPECIAL DIGRAPH MODELS
12. NETWORK FLOWS and APPLICATIONS
13. GRAPHICAL ENUMERATION
14. ALGEBRAIC SPECIFICATION of GRAPHS
15. NONPLANAR LAYOUTS
APPENDIX
BIBLIOGRAPHY
INDEXES
PREFACEInterest in graphs and their applications has grown exponentially in the past two decades, largely due to the usefulness of graphs as models for computation and optimization. This comprehensive introduction targets the need for a fresh approach to the theory, integrated with a careful exposition of emerging methods, models, and practical needs. It is suitable for classroom presentation at the introductory graduate or advanced undergraduate level, or for self-study and reference by working professionals. Graph
theory has evolved as a collection of seemingly disparate
topics. The intent of the authors is to present this
material in a more cohesive framework, characteristic of
mathematical areas with longer traditions, such as linear
algebra and group theory. In the process, important
techniques and analytic tools are transformed into a
unified Emphasis throughout is conceptual, with more than 750 graph drawings included to strengthen intuition and more than 1600 exercises ranging from routine drill to more challenging problem solving. Applications and concrete examples are designed to stimulate interest in and demonstrate the relevance of new concepts. Algorithms are written in a concise format, shorn of the details of computer implementation. Computer science students will find numerous projects inviting them to convert algorithms to computer programs. Software design issues are addressed throughout the book in the form of computational notes, which can be skipped by those not interested in implementation. These design issues include reusability and the user interface, as well as more familiar criteria of efficient use of computational resources. Chapters 1 through 6 concentrate on modeling, representation, and basic properties. Graphical constructions here are always concrete and primarily spatial, with necessary abstractions introduced in a supportive role. Chapters 7 through 12 broaden the scope. Chapter 7 introduces the concept of graph mapping and its relationship to network emulation, and Chapters 8 and 9 discuss drawings of graphs on surfaces. Chapters 10 through 12 concern several kinds of graph optimization problems: graph coloring, special digraph models, and network flow. Some instructors of a one-semester course might consider leaving various sections of earlier chapters for self-study by students. This would allow more time for Chapters 13 through 15, which concern enumeration, specification by voltage graphs, and constructing nonplanar layouts. Most of the material in Chapters 1 through 6 assumes no prerequisite. However, some familiarity with topics typically found in an undergraduate course in discrete mathematics would be useful, and those topics appear briefly in the appendix (along with some linear algebra, which is used in Section 4.7). The appendix provides a quick review (including permutation groups) for some of the more advanced topics in the later chapters. Several different chapter sequences can make up a one-semester course. The definitions and results from Chapter 1, from Sections 2.1 through 2.4 of Chapter 2, and from Section 3.1 of Chapter 3 are used throughout the text, and they should be covered in any course that uses the book. The remaining chapters are largely independent of each other, with several notable exceptions, as follows:
A course oriented toward operations research/ optimization should include most or all of the material in Chapters 4 through 6 and 10 through 12, along with various other sections of the instructor's choice, depending on the time available. A course emphasizing the role of data structures and algorithms might add to the above topics the material in Chapter 3. A more general course in graph theory might replace some of the optimization and algorithmic material with selections from graph operations (Chapter 7), graph drawings (Chapter 8), planarity (Chapter 9), colorings (Chapter 10), enumeration (Chapter 13), voltage graphs (Chapter 14), or graphs on general surfaces (Chapter 15). Several readers of our manuscript at various stages offered many helpful suggestions regarding the mathematical content. In particular, we would like to thank Bob Brigham, Jianer Chen, Lynn Kiaer, Ward Klein, Ben Manvel, Buck McMorris, Joe Straight, Tom Tucker, and Dav Zimak. We also thank Betsey Maupin for her proofreading and for her many stylistic suggestions. 585
Pages |
graph, theory, gross, yellen, trees, connectivity, planarity, coloring, graphical, models, electrical, communications, network, computer, architectures, optimization, operations, analysis, scheduling, job, assignment, voltage graphs, algebraic specification, algebra