Graph Theory Modeling, Applications, and Algorithms

ISBN-10: 0131423843

ISBN-13: 9780131423848

Edition: 2007

Authors: Geir Agnarsson, Raymond Greenlaw

List price: $117.80
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


Once considered an ldquo;unimportantrdquo; branch of topology, graph theory has come into its own through many important contributions to a wide range of fields and is now one of the fastest-growing areas in discrete mathematics and computer science. This practical, intuitive book introduces basic concepts, definitions, theorems, and examples from graph theory. Presents a collection of interesting results from mathematics that involve key concepts and proof techniques. Covers design and analysis of computer algorithms for solving problems in graph theory. Discusses applications of graph theory to the sciences. Includes a collection of graph algorithms, written in Java, that are ready for compiling and running. For anyone interested in learning graph theory, discrete structures, or algorithmic design for graph problems.
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Periodic Table Online content $4.95 $1.99
Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
SQL Online content $4.95 $1.99
Add to cart
Study Briefs
MS Excel® 2010 Online content $4.95 $1.99
Customers also bought

Book details

List price: $117.80
Copyright year: 2007
Publisher: Prentice Hall PTR
Publication date: 9/22/2006
Binding: Paperback
Pages: 464
Size: 7.00" wide x 9.50" long x 1.00" tall
Weight: 1.782
Language: English

Introduction to Graph Theory
Why Study Graphs?
Mathematical Preliminaries
The Definition of a Graph
Examples of Common Graphs
Degrees and Regular Graphs
The Definition of a Directed Graph
Indegrees and Outdegrees in a Digraph
Basic Concepts in Graph Theory
Paths and Cycles
Homomorphisms and Isomorphisms of Graphs
More on Isomorphisms on Simple Graphs
Formations and Minors of Graphs
Homomorphisms and Isomorphisms for Digraphs
Digraph Connectivity
Trees and Forests
Trees and Some of Their Basic Properties
Characterizations of Trees
Inductive Proofs on Trees
Erdos-Szekeres Theorem on Sequences
Centers in Trees
Rooted Trees
Binary Trees
Levels in Rooted and Binary Trees
Spanning Trees
Spanning Trees and Forests
Spanning Trees of the Complete Graph
The Adjacency Matrix of a Graph
The Incidence Matrix of a Graph
The Matrix-Tree Theorem
An Application to Electrical Networks
Minimum Cost Spanning Trees
Fundamental Properties of Graphs and Digraphs
Bipartite Graphs
Eulerian Graphs
Hamiltonian Graphs
Hamiltonian Cycles in Weighted Graphs
Eulerian and Hamiltonian Digraphs
Tournament Digraphs
On the Adjacency Matrix of a Digraph
Acyclic Digraphs and Posets
Connectivity and Flow
Edge Cuts
Edge Connectivity and Connectivity
Blocks in Separable Graphs
Flows in Networks
The Theorems of Menger
Planar Graphs
Embeddings in Surfaces
More on Planar Embeddings
Euler's Formula and Consequences
Characterization of Planar Graphs
Kuratowski and Wagner's Theorem
Plane Duality
Higher Genus
Generalization of Euler's Formula
Crossing Number
Graph Coloring
The Chromatic Number of a Graph
Multipartite Graphs
Results for General Graphs
Planar Graphs and Other Surface Graphs
Edge Coloring of a Graph
Tait's Theorem
Coloring Enumerations and Chordal Graphs
The Chromatic Polynomial of a Graph
Basic Properties of the Chromatic Polynomial
Interval and Intersection Graphs
Chordal Graphs
Powers of Graphs
Independence, Dominance, and Matchings
Independence of Vertices
Domination of Vertices
Matchings in a Graph
Hall's Marriage Theorem
Cover Parameters and Matching Polynomials
Covers and Related Parameters
Rook Polynomials and Bipartite Graphs
The Matching Defect Polynomial
Matching Algorithms
Graph Counting
Basic Counting Results
Generating Functions
Partitions of a Finite Set
The Labeled Counting Lemma
The Exponential Formula
The Number Two and Related Graphs
Two-Regular Graphs
Two-Colorable Graphs
Even Graphs
Graph Algorithms
Recap of Algorithms Already Presented
Algorithm Efficiency
Breadth-First Search
Depth-First Search
Connected Components
Dijkstra's Shortest Path Algorithm
Java Source Code
Greek Alphabet
Top Ten Online References
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.