Introduction to Graph Theory

By: West, Douglas BrentMaterial type: TextTextPublication details: New Delhi: PHI Learning, 2001Edition: 2nd edDescription: xix, 588 p. illustrations; 24 cmISBN: 9788120321427Subject(s): Graph theory | Optimisation | Valeur propreDDC classification: 511.5
Contents:
1. Fundamental Concepts. What Is a Graph? Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs.2. Trees and Distance. Basic Properties. Spanning Trees and Enumeration. Optimization and Trees.3. Matchings and Factors. Matchings and Covers. Algorithms and Applications. Matchings in General Graphs.4. Connectivity and Paths. Cuts and Connectivity. k-connected Graphs. Network Flow Problems.5. Coloring of Graphs. Vertex Colorings and Upper Bounds. Structure of k-chromatic Graphs. Enumerative Aspects.6. Planar Graphs. Embeddings and Euler's Formula. Characterization of Planar Graphs. Parameters of Planarity.7. Edges and Cycles. Line Graphs and Edge-Coloring. Hamiltonian Cycles. Planarity, Coloring, and Cycles.8. Additional Topics (Optional). Perfect Graphs. Matroids. Ramsey Theory. More Extremal Problems. Random Graphs. Eigenvalues of Graphs.Appendix A: Mathematical Background. Appendix B: Optimization and Complexity. Appendix C: Hints for Selected Exercises. Appendix D: Glossary of Terms. Appendix E: Supplemental Reading. Appendix F: References. Indices.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode Item holds
General Books General Books Central Library, Sikkim University
General Book Section
511.5 WES/I (Browse shelf(Opens below)) C1 Available P04205
General Books General Books Central Library, Sikkim University
General Book Section
511.5 WES/I (Browse shelf(Opens below)) C2 Checked out 07/11/2024 052186
Total holds: 0

1. Fundamental Concepts. What Is a Graph? Paths, Cycles, and Trails. Vertex Degrees and Counting. Directed Graphs.2. Trees and Distance. Basic Properties. Spanning Trees and Enumeration. Optimization and Trees.3. Matchings and Factors. Matchings and Covers. Algorithms and Applications. Matchings in General Graphs.4. Connectivity and Paths. Cuts and Connectivity. k-connected Graphs. Network Flow Problems.5. Coloring of Graphs. Vertex Colorings and Upper Bounds. Structure of k-chromatic Graphs. Enumerative Aspects.6. Planar Graphs. Embeddings and Euler's Formula. Characterization of Planar Graphs. Parameters of Planarity.7. Edges and Cycles. Line Graphs and Edge-Coloring. Hamiltonian Cycles. Planarity, Coloring, and Cycles.8. Additional Topics (Optional). Perfect Graphs. Matroids. Ramsey Theory. More Extremal Problems. Random Graphs. Eigenvalues of Graphs.Appendix A: Mathematical Background. Appendix B: Optimization and Complexity. Appendix C: Hints for Selected Exercises. Appendix D: Glossary of Terms. Appendix E: Supplemental Reading. Appendix F: References. Indices.

There are no comments on this title.

to post a comment.
SIKKIM UNIVERSITY
University Portal | Contact Librarian | Library Portal

Powered by Koha