Graph Theory and Its Applications, Second Edition
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.
讀者評論 - 撰寫評論
其他版本 - 查看全部
acyclic adjacent algorithm appendage Application assigned automorphism bijection binary tree bipartite graph Cayley graph chromatic number circulant graph colors complete bipartite graph complete graph components connected graph construction contains Corollary corresponding covering graph cut-vertex cycle graph deﬁned DEFINITION deleting denoted depth-ﬁrst search digraph directed edge-coloring edge-connectivity edge-cut edge-set endpoints eulerian tour Example EXERCISES for Section ﬁnd ﬁrst ﬁve ﬂow frontier edge given graph graph G graph of Exercise Graph Theory hamiltonian cycle induced integers intersection graph isomorphism types iteration labeled Lemma Let G linear graph mapping matching matrix maximum minimum number non-adjacent non-tree nonplanar number of edges number of vertices pair partition permutation group Petersen graph planar drawing problem Proof Proposition Prove result rooted tree self-loops shown in Figure shows simple graph spanning tree speciﬁed subgraph H subtree Suppose surface TERMINOLOGY Theorem topological tournament traversal vertex-coloring vertex-connectivity vertex-set voltage graph