Background
Chartrand, Gary Theodore was born on August 24, 1936 in Sault Ste. Marie, Michigan, United States. Son of Theodore Alexander and Phyllis Genevieve (Mitchell) Chartrand.
(Designed as the bridge to cross the widening gap between ...)
Designed as the bridge to cross the widening gap between mathematics and computer science, and planned as the mathematical base for computer science students, this maths text is written for upper-level college students who have had previous coursework involving proofs and proof techniques. The close tie between the theoretical and algorithmic aspects of graph theory, and graphs that lend themselves naturally as models in computer science, results in a need for efficient algorithims to solve any large scale problems. Each algorithm in the text includes explanatory statements that clarify individual steps, a worst-case complexity analysis, and algorithmic correctness proofs. As a result, the student will develop an understanding of the concept of an efficient algorithm.
http://www.amazon.com/gp/product/0075571013/?tag=2022091-20
( Continuing to provide a carefully written, thorough int...)
Continuing to provide a carefully written, thorough introduction, Graphs & Digraphs, Fifth Edition expertly describes the concepts, theorems, history, and applications of graph theory. Nearly 50 percent longer than its bestselling predecessor, this edition reorganizes the material and presents many new topics. New to the Fifth Edition • New or expanded coverage of graph minors, perfect graphs, chromatic polynomials, nowhere-zero flows, flows in networks, degree sequences, toughness, list colorings, and list edge colorings • New examples, figures, and applications to illustrate concepts and theorems • Expanded historical discussions of well-known mathematicians and problems • More than 300 new exercises, along with hints and solutions to odd-numbered exercises at the back of the book • Reorganization of sections into subsections to make the material easier to read • Bolded definitions of terms, making them easier to locate Despite a field that has evolved over the years, this student-friendly, classroom-tested text remains the consummate introduction to graph theory. It explores the subject’s fascinating history and presents a host of interesting problems and diverse applications.
http://www.amazon.com/gp/product/1439826277/?tag=2022091-20
( Graphs & Digraphs masterfully employs student-friendly ...)
Graphs & Digraphs masterfully employs student-friendly exposition, clear proofs, abundant examples, and numerous exercises to provide an essential understanding of the concepts, theorems, history, and applications of graph theory. Fully updated and thoughtfully reorganized to make reading and locating material easier for instructors and students, the Sixth Edition of this bestselling, classroom-tested text: • Adds more than 160 new exercises • Presents many new concepts, theorems, and examples • Includes recent major contributions to long-standing conjectures such as the Hamiltonian Factorization Conjecture, 1-Factorization Conjecture, and Alspach’s Conjecture on graph decompositions • Supplies a proof of the perfect graph theorem • Features a revised chapter on the probabilistic method in graph theory with many results integrated throughout the text At the end of the book are indices and lists of mathematicians’ names, terms, symbols, and useful references. There is also a section giving hints and solutions to all odd-numbered exercises. A complete solutions manual is available with qualifying course adoption. Graphs & Digraphs, Sixth Edition remains the consummate text for an advanced undergraduate level or introductory graduate level course or two-semester sequence on graph theory, exploring the subject’s fascinating history while covering a host of interesting problems and diverse applications.
http://www.amazon.com/gp/product/1498735762/?tag=2022091-20
( Chartrand and Zhang's Discrete Mathematics presents a c...)
Chartrand and Zhang's Discrete Mathematics presents a clearly written, student-friendly introduction to discrete mathematics. The authors draw from their background as researchers and educators to offer lucid discussions and descriptions fundamental to the subject of discrete mathematics. Unique among discrete mathematics textbooks for its treatment of proof techniques and graph theory, topics discussed also include logic, relations and functions (especially equivalence relations and objective functions), algorithms and analysis of algorithms, introduction to number theory, combinatorics (counting, the Pascal triangle, and the binomial theorem), discrete probability, partially ordered sets, lattices and Boolean algebras, cryptography, and finite-state machines. This highly versatile text provides mathematical background used in a wide variety of disciplines, including mathematics and mathematics education, computer science, biology, chemistry, engineering, communications, and business. Some of the major features and strengths of this textbook: Numerous carefully explained examples and applications facilitate learning, More than 1,600 exercises, ranging from elementary to challenging, are included with hints/answers to all odd-numbered exercises, Descriptions of proof techniques are accessible and lively, Students benefit from the historical discussions throughout the textbook, An Instructor's Solutions Manual contains complete solutions to all exercises. Table of Contents: 0. What Is Discrete Mathematics? 1. Logic Statements 2. Sets 3. Methods of Proof 4. Mathematical Induction 5. Relations and Functions 6. Algorithms and Complexity 7. Integers 8. Introduction to Counting 9. Advanced Counting Methods 10. Discrete Probability 11. Partially Ordered Sets and Boolean Algebra 12. Introduction to Graphs 13. Trees 14. Planar Graphs and Graph Colorings Title of related interest also available from Waveland Press: Molluzzo-Buckley, A First Course in Discrete Mathematics (ISBN 9780881339406).
http://www.amazon.com/gp/product/1577667301/?tag=2022091-20
(This is the third edition of the popular text on graph th...)
This is the third edition of the popular text on graph theory. As in previous editions, the text presents graph theory as a mathematical discipline and emphasizes clear exposition and well-written proofs. New in this edition are expanded treatments of graph decomposition and external graph theory, a study of graph vulnerability and domination, and introductions to voltage graphs, graph labelings, and the probabilistic method in graph theory.
http://www.amazon.com/gp/product/041298721X/?tag=2022091-20
Chartrand, Gary Theodore was born on August 24, 1936 in Sault Ste. Marie, Michigan, United States. Son of Theodore Alexander and Phyllis Genevieve (Mitchell) Chartrand.
Bachelor of Science, Michigan State University, 1958; Master of Science, Michigan State University, 1960; Doctor of Philosophy, Michigan State University, 1964.
Assistant professor, associate professor, We. Mich U., Kalamazoo, 1964-1970; professor, We. Mich U., Kalamazoo, since 1970.
(Designed as the bridge to cross the widening gap between ...)
( Graphs & Digraphs masterfully employs student-friendly ...)
( Continuing to provide a carefully written, thorough int...)
( Chartrand and Zhang's Discrete Mathematics presents a c...)
(This is the third edition of the popular text on graph th...)
Member Mathematics Association American, American Mathematics Society, Institute Combinatorics and Its Applications, Pi Mu Epsilon.
1 child, Scot Gary.