Discrete Mathematical Structures

by ; ;
  • ISBN13:


  • ISBN10:


  • Edition: 6th
  • Format: Hardcover
  • Copyright: 2008-07-14
  • Publisher: Pearson
  • View Upgraded Edition

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $193.80 Save up to $147.01
  • Buy Used
    Add to Cart Free Shipping


Supplemental Materials

What is included with this book?

  • The Used and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


Key Message: Discrete Mathematical Structures, Sixth Edition, offers a clear and concise presentation of the fundamental concepts of discrete mathematics. This introductory book contains more genuine computer science applications than any other text in the field, and will be especially helpful for readers interested in computer science. This book is written at an appropriate level for a wide variety of readers, and assumes a college algebra course as the only prerequisite. Key Topics: Fundamentals; Logic; Counting; Relations and Digraphs; Functions; Order Relations and Structures; Trees; Topics in Graph Theory; Semigroups and Groups; Languages and Finite-State Machines; Groups and Coding Market: For all readers interested in discrete mathematics.

Author Biography

Bernard Kolman received his BS in mathematics and physics from Brooklyn College in 1954, his ScM from Brown University in 1956, and his PhD from the University of Pennsylvania in 1965, all in mathematics. He has worked as a mathematician for the US Navy and IBM. He has been a member of the mathematics department at Drexel University since 1964, and has served as Acting Head of the department. His research activities have included Lie algebra and perations research. He belongs to a number of professional associations and is a member of Phi Beta Kappa, Pi Mu Epsilon, and Sigma Xi.


Robert C. Busby received his BS in physics from Drexel University in 1963, his AM in 1964 and PhD in 1966, both in mathematics from the University of Pennsylvania. He has served as a faculty member of the mathematics department at Drexel since 1969. He has consulted in applied mathematics and industry and government, including three years as a consultant to the Office of Emergency Preparedness, Executive Office of the President, specializing in applications of mathematics to economic problems. He has written a number of books and research papers on operator algebra, group representations, operator continued fractions, and the applications of probability and statistics to mathematical demography.


Sharon Cutler Ross received a SB in mathematics from the Massachusetts Institute of Technology in 1965, an MAT in secondary mathematics from Harvard University in 1966, and a PhD in mathematics from Emory University in 1976. She has taught junior high, high school, and college mathematics, and has taught computer science at the collegiate level. She has been a member of the mathematics department at DeKalb College. Her current professional interests are in undergraduate mathematics education and alternative forms of assessment. Her interests and associations include the Mathematical Association of America, the American Mathematical Association of Two-Year Colleges, and UME Trends. She is a member of Sigma Xi and other organizations.

Table of Contents

Sets and Subsets
Operations on Sets
Properties of Integers
Mathematical Structures
Propositions and Logical Operations
Conditional Statements
Methods of Proof
Mathematical Induction
Mathematical Statements
Logic and Problem Solving
Pigeonhole Principle
Elements of Probability
Recurrence Relations 112
Relations and Digraphs
Product Sets and Partitions
Relations and Digraphs
Paths in Relations and Digraphs
Properties of Relations
Equivalence Relations
Data Structures for Relations and Digraphs
Operations on Relations
Transitive Closure and Warshall's Algorithm
Functions for Computer Science
Growth of Functions
Permutation Functions
Order Relations and Structures
Partially Ordered Sets
Extremal Elements of Partially Ordered Sets
Finite Boolean Algebras
Functions on Boolean Algebras
Circuit Design
Labeled Trees
Tree Searching
Undirected Trees
Minimal Spanning Trees
Topics in Graph Theory
Euler Paths and Circuits
Hamiltonian Paths and Circuits
Transport Networks
Matching Problems
Coloring Graphs
Semigroups and Groups
Binary Operations Revisited
Products and Quotients of Semigroups
Products and Quotients of Groups
Other Mathematical Structures
Languages and Finite-State Machines
Representations of Special Grammars and Languages
Finite-State Machines
Monoids, Machines, and Languages
Machines and Regular Languages
Simplification of Machines
Groups and Coding
Table of Contents provided by Publisher. All Rights Reserved.

Rewards Program

Write a Review