{"publishers": ["Pearson Prentice Hall"], "isbn_10": ["0131679953"], "pagination": "p. cm.", "covers": [1109256], "lc_classifications": ["QA39.3 .G66 2006", "QA39.3.G66 2006"], "key": "/books/OL3425410M", "authors": [{"key": "/authors/OL391576A"}], "publish_places": ["Upper Saddle River, N.J"], "contributions": ["Parmenter, Michael M."], "languages": [{"key": "/languages/eng"}], "genres": ["Textbooks."], "source_records": ["marc:marc_records_scriblio_net/part15.dat:146750561:741", "marc:marc_loc_updates/v38.i15.records.utf8:4307282:949", "bwb:9780131679955", "marc:marc_loc_2016/BooksAll.2016.part32.utf8:171691207:949", "ia:discretemathemat0000good_r0x9", "promise:bwb_daily_pallets_2022-03-17", "idb:9780131679955"], "title": "Discrete mathematics with graph theory", "dewey_decimal_class": ["510"], "identifiers": {"librarything": ["1002060"], "goodreads": ["388054"]}, "edition_name": "3rd ed.", "lccn": ["2005048789"], "subjects": ["Mathematics -- Textbooks", "Computer science -- Mathematics -- Textbooks", "Graph theory -- Textbooks"], "publish_date": "2006", "publish_country": "nju", "by_statement": "Edgar G. Goodaire, Michael M. Parmenter.", "works": [{"key": "/works/OL2682030W"}], "type": {"key": "/type/edition"}, "ocaid": "discretemathemat0000good_r0x9", "oclc_numbers": ["60312096"], "local_id": ["urn:bwbsku:P7-CVK-643"], "number_of_pages": 592, "table_of_contents": [{"level": 0, "label": "", "title": "Preface", "pagenum": "xi"}, {"level": 0, "label": "", "title": "To the Student", "pagenum": "xv"}, {"level": 0, "label": "", "title": "Suggested Lecture Schedule", "pagenum": "xix"}, {"level": 0, "label": "0", "title": "Yes, There Are Proofs!", "pagenum": "1"}, {"level": 1, "label": "0.1", "title": "Compound Statements", "pagenum": "2"}, {"level": 1, "label": "0.2", "title": "Proofs in Mathematics", "pagenum": "10"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "17"}, {"level": 0, "label": "1", "title": "Logic", "pagenum": "19"}, {"level": 1, "label": "1.1", "title": "Truth Tables", "pagenum": "19"}, {"level": 1, "label": "1.2", "title": "The Algebra of Propositions", "pagenum": "23"}, {"level": 1, "label": "1.3", "title": "Logical Arguments", "pagenum": "30"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "36"}, {"level": 0, "label": "2", "title": "Sets and Relations", "pagenum": "38"}, {"level": 1, "label": "2.1", "title": "Sets", "pagenum": "38"}, {"level": 1, "label": "2.2", "title": "Operations on Sets", "pagenum": "43"}, {"level": 1, "label": "2.3", "title": "Binary Relations", "pagenum": "51"}, {"level": 1, "label": "2.4", "title": "Equivalence Relations", "pagenum": "57"}, {"level": 1, "label": "2.5", "title": "Partial Orders", "pagenum": "64"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "70"}, {"level": 0, "label": "3", "title": "Functions", "pagenum": "72"}, {"level": 1, "label": "3.1", "title": "Basic Terminology", "pagenum": "72"}, {"level": 1, "label": "3.2", "title": "Inverses and Composition", "pagenum": "80"}, {"level": 1, "label": "3.3", "title": "One-to-One Correspondence and the Cardinality of a Set", "pagenum": "88"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "96"}, {"level": 0, "label": "4", "title": "The Integers", "pagenum": "98"}, {"level": 1, "label": "4.1", "title": "The Division Algorithm", "pagenum": "98"}, {"level": 1, "label": "4.2", "title": "Divisibility and the Euclidean Algorithm", "pagenum": "105"}, {"level": 1, "label": "4.3", "title": "Prime Numbers", "pagenum": "114"}, {"level": 1, "label": "4.4", "title": "Congruence", "pagenum": "125"}, {"level": 1, "label": "4.5", "title": "Applications of Congruence", "pagenum": "135"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "145"}, {"level": 0, "label": "5", "title": "Induction and Recursion", "pagenum": "147"}, {"level": 1, "label": "5.1", "title": "Mathematical Induction", "pagenum": "147"}, {"level": 1, "label": "5.2", "title": "Recursively Defined Sequences", "pagenum": "160"}, {"level": 1, "label": "5.3", "title": "Solving Recurrence Relations; The Characteristic Polynomial", "pagenum": "170"}, {"level": 1, "label": "5.4", "title": "Solving Recurrence Relations; Generating Functions", "pagenum": "176"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "182"}, {"level": 0, "label": "6", "title": "Principles of Counting", "pagenum": "184"}, {"level": 1, "label": "6.1", "title": "The Principle of Inclusion-Exclusion", "pagenum": "184"}, {"level": 1, "label": "6.2", "title": "The Addition and Multiplication Rules", "pagenum": "192"}, {"level": 1, "label": "6.3", "title": "The Pigeonhole Principle", "pagenum": "199"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "204"}, {"level": 0, "label": "7", "title": "Permutations and Combinations", "pagenum": "205"}, {"level": 1, "label": "7.1", "title": "Permutations", "pagenum": "205"}, {"level": 1, "label": "7.2", "title": "Combinations", "pagenum": "210"}, {"level": 1, "label": "7.3", "title": "Elementary Probability", "pagenum": "216"}, {"level": 1, "label": "7.4", "title": "Probability Theory", "pagenum": "224"}, {"level": 1, "label": "7.5", "title": "Repetitions", "pagenum": "231"}, {"level": 1, "label": "7.6", "title": "Derangements", "pagenum": "236"}, {"level": 1, "label": "7.7", "title": "The Binomial Theorem", "pagenum": "239"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "245"}, {"level": 0, "label": "8", "title": "Algorithms", "pagenum": "247"}, {"level": 1, "label": "8.1", "title": "What Is an Algorithm?", "pagenum": "247"}, {"level": 1, "label": "8.2", "title": "Complexity", "pagenum": "253"}, {"level": 1, "label": "8.3", "title": "Searching and Sorting", "pagenum": "265"}, {"level": 1, "label": "8.4", "title": "Enumeration of Permutations and Combinations", "pagenum": "276"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "280"}, {"level": 0, "label": "9", "title": "Graphs", "pagenum": "281"}, {"level": 1, "label": "9.1", "title": "A Gentle Introduction", "pagenum": "281"}, {"level": 1, "label": "9.2", "title": "Definitions and Basic Properties", "pagenum": "288"}, {"level": 1, "label": "9.3", "title": "Isomorphism", "pagenum": "296"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "301"}, {"level": 0, "label": "10", "title": "Paths and Circuits", "pagenum": "304"}, {"level": 1, "label": "10.1", "title": "Eulerian Circuits", "pagenum": "304"}, {"level": 1, "label": "10.2", "title": "Hamiltonian Cycles", "pagenum": "311"}, {"level": 1, "label": "10.3", "title": "The Adjacency Matrix", "pagenum": "319"}, {"level": 1, "label": "10.4", "title": "Shortest Path Algorithms", "pagenum": "326"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "336"}, {"level": 0, "label": "11", "title": "Applications of Paths and Circuits", "pagenum": "339"}, {"level": 1, "label": "11.1", "title": "The Chinese Postman Problem", "pagenum": "339"}, {"level": 1, "label": "11.2", "title": "Digraphs", "pagenum": "344"}, {"level": 1, "label": "11.3", "title": "RNA Chains", "pagenum": "352"}, {"level": 1, "label": "11.4", "title": "Tournaments", "pagenum": "356"}, {"level": 1, "label": "11.5", "title": "Scheduling Problems", "pagenum": "361"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "367"}, {"level": 0, "label": "12", "title": "Trees", "pagenum": "370"}, {"level": 1, "label": "12.1", "title": "Trees and Their Properties", "pagenum": "370"}, {"level": 1, "label": "12.2", "title": "Spanning Trees", "pagenum": "379"}, {"level": 1, "label": "12.3", "title": "Minimum Spanning Tree Algorithms", "pagenum": "384"}, {"level": 1, "label": "12.4", "title": "Acyclic Digraphs and Bellman's Algorithm", "pagenum": "393"}, {"level": 1, "label": "12.5", "title": "Depth-First Search", "pagenum": "398"}, {"level": 1, "label": "12.6", "title": "The One-Way Street Problem", "pagenum": "403"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "409"}, {"level": 0, "label": "13", "title": "Planar Graphs and Colorings", "pagenum": "411"}, {"level": 1, "label": "13.1", "title": "Planar Graphs", "pagenum": "411"}, {"level": 1, "label": "13.2", "title": "Coloring Graphs", "pagenum": "419"}, {"level": 1, "label": "13.3", "title": "Circuit Testing and Facilities Design", "pagenum": "427"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "435"}, {"level": 0, "label": "14", "title": "The Max Flow-Min Cut Theorem", "pagenum": "438"}, {"level": 1, "label": "14.1", "title": "Flows and Cuts", "pagenum": "438"}, {"level": 1, "label": "14.2", "title": "Constructing Maximal Flows", "pagenum": "445"}, {"level": 1, "label": "14.3", "title": "Applications", "pagenum": "450"}, {"level": 1, "label": "14.4", "title": "Matchings", "pagenum": "454"}, {"level": 1, "label": "", "title": "Review Exercises", "pagenum": "460"}, {"level": 0, "label": "", "title": "Appendix", "pagenum": "A-1"}, {"level": 0, "label": "", "title": "Solutions to True/False Questions and Selected Exercises", "pagenum": "S-1"}, {"level": 0, "label": "", "title": "Glossary", "pagenum": "G-1"}, {"level": 0, "label": "", "title": "Index", "pagenum": "I-1"}], "latest_revision": 13, "revision": 13, "created": {"type": "/type/datetime", "value": "2008-04-01T03:28:50.625462"}, "last_modified": {"type": "/type/datetime", "value": "2025-09-15T14:47:22.061896"}}