<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Discrete Mathematics</title>
    <subTitle>with Graph Theory</subTitle>
  </titleInfo>
  <name type="personal">
    <namePart>G.Goodaire, Edgar</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource/>
  <originInfo>
    <place>
      <placeTerm type="text">Prentice Hall</placeTerm>
    </place>
    <publisher>India</publisher>
    <dateIssued>2003</dateIssued>
    <edition>2nd Edition </edition>
    <issuance/>
  </originInfo>
  <physicalDescription>
    <extent>545 p</extent>
  </physicalDescription>
  <tableOfContents>Yes , there are proofs (Page-1), Sets and Relations (Page-37), Functions (Page-71), The Integers (Page-97), Induction and Recursion (Page-149), Principles of Counting (Page-187), Permuatation and Combinations (Page-211), Algorithms (Page-239), Graphs (Page-277), Paths and Cicuits (Page-303), Applications of Paths and circuits (Page-337), Trees (Page-367), Depth First search and applications (Page-399), Planar Graphs and Coloring (Page-413), The Max Flow (Page-441).</tableOfContents>
  <note type="statement of responsibility">Edgar G.Goodaire, Michael M. Parmenter </note>
  <subject>
    <topic>Graph Theory</topic>
  </subject>
  <classification authority="ddc">511,GOO</classification>
  <identifier type="isbn">8120321219</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg"/>
    <recordChangeDate encoding="iso8601">20230704120734.0</recordChangeDate>
  </recordInfo>
</mods>
