Gift Guide

Introductory Discrete Mathematics

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 96%)
Other sellers (Hardcover)
  • All (8) from $1.99   
  • New (2) from $50.00   
  • Used (6) from $1.99   
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any coupons and promotions
Seller since 2014

Feedback rating:



New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Seller since 2008

Feedback rating:


Condition: New

Ships from: Naperville, IL

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Sort by


Concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms to solve these problems. Applications are emphasized and more than 200 exercises help students test their grasp of the material. Appendix. Bibliography. Answers to Selected Exercises.
Read More Show Less

Product Details

  • ISBN-13: 9780130399427
  • Publisher: Prentice Hall
  • Publication date: 3/28/1991
  • Pages: 236

Table of Contents

0 Set Theory and Logic
  0.1 Introduction to Set Theory
  0.2 Functions and Relations
  0.3 Inductive Proofs and Recursive Definitions
  0.4 The Language of Logic
  0.5 Notes and References
  0.6 Exercises
1 Combinatorics
  1.1 Two Basic Counting Rules
  1.2 Permutations
  1.3 Combinations
  1.4 More on Permutations and Combinations
  1.5 The Pigeonhole Principle
  1.6 The Inclusion-Exclusion Principle
  1.7 Summary of Results in Combinatorics
  1.8 Notes and References
  1.9 Exercises
2 Generating Functions
  2.1 Introduction
  2.2 Ordinary Generating Functions
  2.3 Exponential Generating Functions
  2.4 Notes and References
  2.5 Exercises
3 Recurrence Relations
  3.1 Introduction
  3.2 Homogeneous Recurrence Relations
  3.3 Inhomogeneous Recurrence Relations
  3.4 Recurrence Relations and Generating Functions
  3.5 Analysis of Alogorithms
  3.6 Notes and References
  3.7 Exercises
4 Graphs and Digraphs
  4.1 Introduction
  4.2 Adjacency Matrices and Incidence Matrices
  4.3 Joining in Graphs
  4.4 Reaching in Digraphs
  4.5 Testing Connectedness
  4.6 Strong Orientation of Graphs
  4.7 Notes and References
  4.8 Exercises
5 More on Graphs and Digraphs
  5.1 Eulerian Paths and Eulerian Circuits
  5.2 Coding and de Bruijn Digraphs
  5.3 Hamiltonian Paths and Hamiltonian Cycles
  5.4 Applications of Hamiltonian Cycles
  5.5 Vertex Coloring and Planarity of Graphs
  5.6 Notes and References
  5.7 Exercises
6 Trees and Their Applications
  6.1 Definitions and Properties
  6.2 Spanning Trees
  6.3 Binary Trees
  6.4 Notes and References
  6.5 Exercises
7 Spanning Tree Problems
  7.1 More on Spanning Trees
  7.2 Kruskal's Greedy Algorithm
  7.3 Prim's Greedy Algorithm
  7.4 Comparison of the Two Algorithms
  7.5 Notes and References
  7.6 Exercises
8 Shortest Path Problems
  8.1 Introduction
  8.2 Dijkstra's Algorithm
  8.3 Floyd-Warshall Algorithm
  8.4 Comparison of the Two Algorithms
  8.5 Notes and References
  8.6 Exercises
Appendix What is NP-Completeness?
  A.1 Problems and Their Instances
  A.2 The Size of an Instance
  A.3 Algorithm to Solve a Problem
  A.4 Complexity of an Algorithm
  A.5 "The "Big Oh" or the O(ยท) Notation"
  A.6 Easy Problems and Difficult Problems
  A.7 The Class P and the Class NP
  A.8 Polynomial Transformations and NP-Completeness
  A.9 Coping with Hard Problems
Answers to Selected Exercises
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)