Introduction to graph theory / by Douglas B. West.
Material type: TextPublisher: Upper Saddle River, N.J. : Prentice Hall, [2001]Copyright date: ©2001Edition: Second editionDescription: xix, 588 pages : illustrations ; 25 cmContent type:- text
- unmediated
- volume
- 9788120321427
- QA166 .W43 2001
Item type | Current library | Home library | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
Books | Chinhoyi University of Technology Libraries | Chinhoyi University of Technology Libraries | QA 166 WES (Browse shelf(Opens below)) | c.043520 | Available | BK0052748 |
Browsing Chinhoyi University of Technology Libraries shelves Close shelf browser (Hides shelf browser)
QA 164 MOT Discrete mathematics for computer scientists and mathematicians / | QA 164 MOT Discrete mathematics for computer scientists and mathematicians / | QA 164 MOT Discrete mathematics for computer scientists and mathematicians / | QA 166 WES Introduction to graph theory / | QA 167.2 BAL Finite geometry and combinatorial applications / | QA 171 LED Introduction to group theory. | QA 171 LED Introduction to group theory. |
Includes bibliographical references (pages 537-568) and indexes.
ch. 1. Fundamental concepts: What is a graph? -- Paths, cycles, and trails -- Vertex degrees and counting -- Directed graphs -- ch. 2. Trees and distance: Basic properties -- Spanning trees and enumeration -- Optimization and trees -- ch. 3. Matchings and factors: Matchings and covers -- Algorithms and applications -- Matchings in general graphs -- ch. 4. Connectivity and paths: Cuts and connectivity -- k-connected graphs -- Network flow problems -- ch. 5. Coloring of graphs: Vertex colorings and upper bounds -- Structure of k-chromatic graphs -- Enumerative aspects -- ch. 6. Planar graphs: Embeddings and Euler's formula -- Characterization of Planar graphs -- Parameters of planarity -- ch. 7. Edges and cycles: Line graphs and edge-coloring -- Hamiltonion cycles -- Planarity, coloring, and cycles -- ch. 8. Additional topics (optional): Perfect graphs -- Matroids -- Ramsey theory -- More extremeal problems -- Random graphs -- Eigenvalues of graphs.
There are no comments on this title.