Amazon cover image
Image from Amazon.com

Discrete mathematics with graph theory / Edgar G. Goodaire, Michael M. Parmenter

By: Contributor(s): Material type: TextTextPublication details: Upper Saddle River, N.J. : Pearson Prentice Hall ; London : Pearson Education Ltd., [2006]Edition: 3rd edDescription: xxi, 461 p., [80]p. : figs. ; 26 cmISBN:
  • 9780131679955 .
  • 9780131679955 .
Subject(s):
Partial contents:
Logic -- Sets and relations -- Functions -- The integers -- Induction and recursion -- Principles of counting -- Permutations and combinations -- Algorithms -- Graphs -- Paths and circuits -- Applications of paths and circuits -- Trees -- Planar graphs and colorings -- The max flow-min cut theorem
Summary: Far more 'user friendly' than the vast majority of similar books, this text is truly written with the 'beginning' reader in mind. The pace is tight, the style is light, and the text emphasizes theorem proving throughout. The authors emphasize 'active reading', a skill vital to success in learning how to think mathematically.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
General General ATU Dublin Road General Shelves 510 GOO (Browse shelf(Opens below)) Available J134665

Includes index

Logic -- Sets and relations -- Functions -- The integers -- Induction and recursion -- Principles of counting -- Permutations and combinations -- Algorithms -- Graphs -- Paths and circuits -- Applications of paths and circuits -- Trees -- Planar graphs and colorings -- The max flow-min cut theorem

Far more 'user friendly' than the vast majority of similar books, this text is truly written with the 'beginning' reader in mind. The pace is tight, the style is light, and the text emphasizes theorem proving throughout. The authors emphasize 'active reading', a skill vital to success in learning how to think mathematically.

Previous ed.: 2002

There are no comments on this title.

to post a comment.
Share