Introduction to graph theory / by Daouglas B. West

By: West, Douglas BMaterial type: TextTextPublication details: New Delhi : PHI Learning Private Limited, 2011, 2001cEdition: 2nd edDescription: xix, 588 p. : ill. ; 25 cmISBN: 9788120321427 (pbk)Subject(s): Graph theoryDDC classification: 511.5
Contents:
h. 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 --
Summary: Offering a comprehensive introduction to the fundamental topics of graph theory, this text is for undergraduate or graduate courses in Graph Theory. It includes basic algorithms and emphasizes the
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 Status Date due Barcode Item holds
Books Books Namal Library
Mathematics
511.5 WES-S 2011 601 (Browse shelf (Opens below)) Available 601
Total holds: 0

Include bibliographice and references

h. 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 --

Offering a comprehensive introduction to the fundamental topics of graph theory, this text is for undergraduate or graduate courses in Graph Theory. It includes basic algorithms and emphasizes the

There are no comments on this title.

to post a comment.