Buch, Englisch, 800 Seiten, Format (B × H): 182 mm x 263 mm, Gewicht: 1592 g
Reihe: Textbooks in Mathematics
Buch, Englisch, 800 Seiten, Format (B × H): 182 mm x 263 mm, Gewicht: 1592 g
Reihe: Textbooks in Mathematics
ISBN: 978-1-58488-505-4
Verlag: Chapman and Hall/CRC
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?New chapters on measurement and analytic graph theory Supplementary exercises in each chapter - ideal for reinforcing, reviewing, and testing.Solutions and hints, often illustrated with figures, to selected exercises - nearly 50 pages worthReorganization and extensive revisions in more than half of the existing chapters for smoother flow of the expositionForeshadowing - the first three chapters now preview a number of concepts, mostly via the exercises, to pique the interest of readerGross 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.
Zielgruppe
Advanced undergraduate and graduate level students in mathematics, electrical engineering, computer science, operations research, as well as others with a specific interest in graph theory, particularly algorithmists
Autoren/Hrsg.
Weitere Infos & Material
INTRODUCTION TO GRAPH MODELSGraphs and DigraphsCommon Families of GraphsGraph Modeling ApplicationsWalks and DistancePaths, Cycles, and TreesVertex and Edge Attributes: More ApplicationsSTRUCTURE AND REPRESENTATIONGraph Isomorphism Revised!Automorphisms and Symmetry Moved and revised!SubgraphsSome Graph OperationsTests for Non-IsomorphismMatrix RepresentationMore Graph OperationsTREES Reorganized and revised!Characterizations and Properties of TreesRooted Trees, Ordered Trees, and Binary TreesBinary-Tree TraversalsBinary-Search TreesHuffman Trees and Optimal Prefix CodesPriority TreesCounting Labeled Trees: Prüfer EncodingCounting Binary Trees: Catalan RecursionSPANNING TREES Reorganized and revised!Tree-GrowingDepth-First and Breadth-First SearchMinimum Spanning Trees and Shortest PathsApplications of Depth-First SearchCycles, Edge Cuts, and Spanning TreesGraphs and Vector SpacesMatroids and the Greedy AlgorithmCONNECTIVITY Revised!Vertex- and Edge-ConnectivityConstructing Reliable NetworksMax-Min Duality and Menger's TheoremsBlock DecompositionsOPTIMAL GRAPH TRAVERSALSEulerian Trails and ToursDeBruijn Sequences and Postman ProblemsHamiltonian Paths and CyclesGray Codes and Traveling Salesman ProblemsPLANARITY AND KURATOWSKI'S THEOREM Reorganized and revised!Planar Drawings and Some Basic SurfacesSubdivision and HomeomorphismExtending Planar DrawingsKuratowski's TheoremAlgebraic Tests for PlanarityPlanarity AlgorithmCrossing Numbers and ThicknessDRAWING GRAPHS AND MAPS Reorganized and revised!The Topology of Low DimensionsHigher-Order SurfacesMathematical Model for Drawing GraphsRegular Maps on a SphereImbeddings on Higher-Order SurfacesGeometric Drawings of Graphs New!GRAPH COLORINGSVertex-ColoringsMap-ColoringsEdge-ColoringsFactorization New!MEASUREMENT AND MAPPINGS New Chapter!Distance in Graphs New!Domination in Graphs New!Bandwidth New!Intersection Graphs New!Linear Graph Mappings Moved and revised!Modeling Network Emulation Moved and revised!ANALYTIC GRAPH THEORY New Chapter!Ramsey Graph Theory New!Extremal Graph Theory New!Random Graphs New!SPECIAL DIGRAPH MODELS Reorganized and revised!Directed Paths and Mutual ReachabilityDigraphs as Models for RelationsTournamentsProject Scheduling and Critical PathsFinding the Strong Components of a DigraphNETWORK FLOWS AND APPLICATIONSFlows and Cuts in NetworksSolving the Maximum-Flow ProblemFlows and ConnectivityMatchings, Transversals, and Vertex CoversGRAPHICAL ENUMERATION Reorganized and revised!Automorphisms of Simple GraphsGraph Colorings and SymmetryBurnside's LemmaCycle-Index Polynomial of a Permutation GroupMore Counting, Including Simple GraphsPolya-Burnside EnumerationALGEBRAIC SPECIFICATION OF GRAPHSCyclic VoltagesCayley Graphs and Regular VoltagesPermutation VoltagesSymmetric Graphs and Parallel ArchitecturesInterconnection-Network PerformanceNON-PLANAR LAYOUTS Reorganized and revised!Representing Imbeddings by RotationsGenus Distribution of a GraphVoltage-Graph Specification of Graph LayoutsNon KVL Imbedded Voltage GraphsHeawood Map-Coloring ProblemAPPENDIXLogic FundamentalsRelations and FunctionsSome Basic CombinatoricsAlgebraic StructuresAlgorithmic ComplexitySupplementary ReadingBIBLIOGRAPHYGeneral ReadingReferencesSOLUTIONS AND HINTS New!INDEXESIndex of ApplicationsIndex of AlgorithmsIndex of NotationsGeneral Index
