Discrete Mathematical Structures (Classic Version), 6th edition

  • Bernard Kolman, 
  • Robert Busby, 
  • Sharon C. Ross

Choose the option that's right for you


$9.99 / mo

4-month minimum term for $39.96

  • Access this eText title
  • Up to 2 devices
  • Discounted tutor access


$14.99 / mo

4-month minimum term for $59.96

  • Access over 1,500 titles
  • Up to 2 devices
  • Discounted tutor access

Learn more, spend less

  • Learn anytime, anywhere

    Get the app to access your eText whenever you need it

  • Make it your own

    Your notes. Your highlights. Your eText

  • Find it fast

    Quickly navigate your eText with search

  • Stay organized

    Access all your eTexts in one place

  • Easily continue access

    Keep learning with auto-renew


Discrete Mathematical Structures presents the fundamental concepts of discrete mathematics, while focusing on computer science applications. The authors treat relations and digraphs as two aspects of the same fundamental idea, which is then used as the basis of virtually all concepts in the text.

Published by Pearson (July 14th 2021) - Copyright © 2009

ISBN-13: 9780137538782

Subject: Advanced Math

Category: Discrete Math

Table of contents

1. Fundamentals
1.1 Sets and Subsets
1.2 Operations on Sets
1.3 Sequences
1.4 Properties of Integers
1.5 Matrices
1.6 Mathematical Structures

2. Logic
2.1 Propositions and Logical Operations
2.2 Conditional Statements
2.3 Methods of Proof
2.4 Mathematical Induction
2.5 Mathematical Statements
2.6 Logic and Problem Solving

3. Counting
3.1 Permutations
3.2 Combinations
3.3 Pigeonhole Principle
3.4 Elements of Probability
3.5 Recurrence Relations

4. Relations and Digraphs
4.1 Product Sets and Partitions
4.2 Relations and Digraphs
4.3 Paths in Relations and Digraphs
4.4 Properties of Relations
4.5 Equivalence Relations
4.6 Data Structures for Relations and Digraphs
4.7 Operations on Relations
4.8 Transitive Closure and Warshall's Algorithm

5. Functions

5.1 Functions
5.2 Functions for Computer Science
5.3 Growth of Functions
5.4 Permutation Functions

6. Order Relations and Structures
6.1 Partially Ordered Sets
6.2 Extremal Elements of Partially Ordered Sets
6.3 Lattices
6.4 Finite Boolean Algebras
6.5 Functions on Boolean Algebras
6.6 Circuit Design

7. Trees
7.1 Trees
7.2 Labeled Trees
7.3 Tree Searching
7.4 Undirected Trees
7.5 Minimal Spanning Trees

8. Topics in Graph Theory
8.1 Graphs
8.2 Euler Paths and Circuits
8.3 Hamiltonian Paths and Circuits
8.4 Transport Networks
8.5 Matching Problems
8.6 Coloring Graphs

9. Semigroups and Groups
9.1 Binary Operations Revisited
9.2 Semigroups
9.3 Products and Quotients of Semigroups
9.4 Groups
9.5 Products and Quotients of Groups
9.6 Other Mathematical Structures

10. Languages and Finite-State Machines
10.1 Languages
10.2 Representations of Special Grammars and Languages
10.3 Finite-State Machines
10.4 Monoids, Machines, and Languages
10.5 Machines and Regular Languages
10.6 Simplification of Machines

11. Groups and Coding
11.1 Coding of Binary Information and Error Detection
11.2 Decoding and Error Correction
11.3 Public Key Cryptology

Appendix A: Algorithms and Pseudocode
Appendix B: Additional Experiments in Discrete Mathematics
Appendix C: Coding Exercises

Your questions answered

Introducing Pearson+. Reimagined learning, designed for you. Choose from one eText or over 1,500 eTexts and study tools, all in one place, for one low monthly subscription. A new way to buy books that fits your budget. Make the most of your study time with offline access, enhanced search, notes and flashcards — to get organized, get the work done quicker and get results. Plus, with the app, put textbooks in your pocket and learn wherever. It's time to upgrade the textbook and simplify learning, so you can have time to live too.

Pearson eText is an easy-to-use digital textbook available from Pearson+. Make it your own by adding notes and highlights. Download the Pearson+ mobile app to learn on the go, even offline. Listen on the go with our new audiobook feature, available for most titles.

When you choose a plan, you're signing up for a 4-month 'term'. We will charge your payment method each month until your 4-month term has ended. You can turn on auto-renew in My account at any time to continue your subscription before your 4-month term has ended.

When you purchase a Pearson+ subscription, it will last 4 months. Before your initial 4-month term ends, you can extend your subscription by turning auto-renew on in My account. If you turn auto-renew on, we’ll automatically renew your subscription and charge you every month until you turn off auto-renew.

To avoid the next payment charge, make sure you turn auto renewal off 1 day before the auto renewal date. You can subscribe again after auto-renew has been turned off by purchasing another Pearson+ subscription. We use your credit card to renew your subscription automatically. To make sure your learning is uninterrupted, please check your card details before your first monthly payment.

With a Multi Pearson+ subscription plan, you can download up to 5 titles on the Pearson+ app from My list on each of your authorized devices every month.

When you're using your Multi Pearson+ subscription plan in a browser, you can select and read from as many titles as you like.