Introduction to graph theory /

By: West, Douglas BrentMaterial type: TextTextSeries: Pearson modern classicPublication details: Upper Saddle River, N.J. : Prentice Hall, ©2001Edition: Second editionDescription: xix, 588 pages : illustrationsISBN: 9780131437371 (pbk.); 0131437372 (pbk.); 8120321421Subject(s): Graph theoryDDC classification: 511.5
Contents:
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.
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 understanding and writing of proofs about graphs. It also contains examples and exercises to develop an understanding of the structure of graphs
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 Collection Call number Status Date due Barcode Item holds
Reference Books Reference Books Main Library
Reference 		Reference 511.5 WES (Browse shelf(Opens below)) Available 015541
Lending Books Lending Books Main Library
Stacks 		Reference 511.5 WES (Browse shelf(Opens below)) Checked out 22/03/2024 009381
Total holds: 0

Originally published in 2001, reissued as part of Pearson's modern classic series.

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.

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 understanding and writing of proofs about graphs. It also contains examples and exercises to develop an understanding of the structure of graphs

There are no comments on this title.

to post a comment.

© University of Vavuniya

---