Graph Theory and Its Applications, Second EditionCRC Press, 22 de set. de 2005 - 800 páginas Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come. The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine. What else is new? Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology. |
Outras edições - Ver todos
Graph Theory and Its Applications, Second Edition Jonathan L. Gross,Jay Yellen Prévia não disponível - 2005 |
Termos e frases comuns
acyclic adjacent algorithm appendage Application assigned automorphism bijection binary tree bipartite graph Cayley graph chromatic number circulant graph color complete bipartite graph complete graph components connected graph construction contains Corollary corresponding covering graph cut-vertex cycle graph DEFINITION deleting denoted depth-first search digraph directed edge-coloring edge-connectivity edge-cut edge-set endpoints eulerian tour Example EXERCISES for Section flow frontier edge given graph graph G graph of Exercise Graph Theory induced integers intersection graph isomorphism types iteration labeled Lemma Let G linear graph mapping Markov matching matrix maximum minimum number n-vertex non-tree nonplanar number of edges number of vertices pair partition permutation group planar drawing problem Proof Proposition Prove result rooted tree s-t paths self-loops shown in Figure shows simple graph spanning tree specified subgraph of G subtree Suppose surface Theorem topological tournament traversal Tree-Growing v₁ vertex-coloring vertex-connectivity vertex-set voltage graph walk