DISCRETE MATHEMATICS AND ITS APPLICATIONS

Series Editor KENNETH H. ROSEN

GRAPH THEORY AND ITS APPLICATIONS

SECOND EDITION

JONATHAN L GROSS JAYYELLEN

Chapman & Hall/CRC

Taylor & Francis Group
Boca Raton London New York

CONTENTS
Preface
1. INTRODUCTION to GRAPH MODELS
1.1 1.2 1.3 1.4 1.5 1.6 1.7 Graphs and Digraphs Common Families of Graphs Graph Modeling Applications Walks and Distance Paths, Cycles, and Trees Vertex and Edge Attributes: More Applications Supplementary Exercises Glossary Graph Isomorphism Automorphisms and Symmetry Subgraphs Some Graph Operations Tests for Non-Isomorphism Matrix Representations More Graph Operations Supplementary Exercises Glossary Characterizations and Properties of Trees Rooted Trees, Ordered Trees, and Binary Trees Binary-Tree Traversals Binary-Search Trees Huffman Trees and Optimal Prefix Codes Priority Trees Counting Labeled Trees: Priifer Encoding Counting Binary Trees: Catalan Recursion Supplementary Exercises Glossary Tree Growing Depth-First and Breadth-First Search Minimum Spanning Trees and Shortest Paths Applications of Depth-First Search Cycles, Edge-Cuts, and Spanning Trees Graphs and Vector Spaces Matroids and the Greedy Algorithm Supplementary Exercises Glossary 2 15 22 28 39 48 51 53

2.

STRUCTURE and REPRESENTATION

2.1 2.2 2.3 2.4 2.5 2.6 2.7 2.8 58 65 72 80 89 95 101 107 110

57

3.

TREES
3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 116 124 132 137 141 146 151 156 158 160

115

4.

SPANNING TREES
4.1 4.2 4.3 4.4 4.5 4.6 4.7 4.8 164 171 176 182 190 197 207 212 213

163

5.

CONNECTIVITY
5.1 5.2 5.3 5.4 5.5 Vertex- and Edge-Connectivity Constructing Reliable Networks Max-Min Duality and Menger's Theorems Block Decompositions Supplementary Exercises Glossary 218 223 231 241 244 245

217

6.

OPTIMAL GRAPH TRAVERSALS

6.1 6.2 6.3 6.4 6.5 Eulerian Trails and Tours DeBruijn Sequences and Postman Problems Hamiltonian Paths and Cycles Gray Codes and Traveling Salesman Problems Supplementary Exercises Glossary 248 252 267 273 282 283

247

7.

PLANARITY AND KURATOWSKI'S THEOREM

7.1 7.2 7.3 7.4 7.5 7.6 7.7 7.8 Planar Drawings and Some Basic Surfaces Subdivision and Homeomorphism Extending Planar Drawings Kuratowski's Theorem Algebraic Tests for Planarity Planarity Algorithm Crossing Numbers and Thickness Supplementary Exercises Glossary 286 292 297 304 311 324 327 331 334

285

8. DRAWING GRAPHS AND MAPS

8.1 8.2 8.3 8.4 8.5 8.6 8.7 The Topology of Low Dimensions Higher-Order Surfaces Mathematical Model for Drawing Graphs Regular Maps on a Sphere Imbeddings on Higher-Order Surfaces Geometric Drawings of Graphs Supplementary Exercises Glossary 338 341 346 349 354 361 365 366

337

9.

GRAPH COLORINGS
J.I 9.2 9.3 9.4 9.5 Vertex-Colorings Map-Colorings Edge-Colorings Factorization Supplementary Exercises Glossary 372 386 393 407 411 413

371

10.

MEASUREMENT AND MAPPINGS

10.1 10.2 10.3 10.4 10.5 10.6 10.7 Distance in Graphs Domination in Graphs Bandwidth Intersection Graphs Linear Graph Mappings Modeling Network Emulation Supplementary Exercises Glossary 418 424 430 435 444 453 462 463

417

11.

ANALYTIC GRAPH THEORY

11.1 11.2 11.3 11.4 Ramsey Graph Theory Extremal Graph Theory Random Graphs Supplementary Exercises Glossary 470 475 480 489 490

469

12. SPECIAL DIGRAPH MODELS

12.1 12.2 12.3 12.4 12.5 12.6 Directed Paths and Mutual Reachability Digraphs as Models for Relations Tournaments Project Scheduling and Critical Paths Finding the Strong Components of a Digraph Supplementary Exercises Glossary 494 505 511 516 523 528 529

493

13.

NETWORK FLOWS and APPLICATIONS

13.1 13.2 13.3 13.4 13.5 Flows and Cuts in Networks Solving the Maximum-Flow Problem Flows and Connectivity Matchings, Transversals, and Vertex Covers Supplementary Exercises Glossary 534 542 551 560 573 574

533

14. GRAPHICAL ENUMERATION

14.1 14.2 14.3 14.4 14.5 14.6 14.7 Automorphisms of Simple Graphs Graph Colorings and Symmetry Burnside's Lemma Cycle-Index Polynomial of a Permutation Group More Counting, Including Simple Graphs Polya-Burnside Enumeration Supplementary Exercises Glossary 578 583 589 595 600 606 609 610

577

15. ALGEBRAIC SPECIFICATION of GRAPHS

15.1 15.2 15.3 15.4 15.5 15.6 Cyclic Voltages Cayley Graphs and Regular Voltages Permutation Voltages Symmetric Graphs and Parallel Architectures Interconnection-Network Performance Supplementary Exercises Glossary 614 623 632 637 644 646 649

613

16.

NONPLANAR LAYOUTS
16.1 16.2 16.3 16.4 16.5 16.6 Representing Imbeddings by Rotations Genus Distribution of a Graph Voltage-Graph Specification of Graph Layouts Non-KVL Imbedded Voltage Graphs Heawood Map-Coloring Problem Supplementary Exercises Glossary 652 659 664 670 672 677 678

651

APPENDIX
A.I A.2 A.3 A.4 A.5 A.6 Logic Fundamentals Relations and Functions Some Basic Combinatorics Algebraic Structures Algorithmic Complexity Supplementary Reading 681 683 686 687 692 694

681

BIBLIOGRAPHY
B.I B.2 General Reading References 695 697

695

SOLUTIONS and HINTS INDEXES

1.1 1.2 1.3 1.4 Index of Applications Index of Algorithms Index of Notations General Index 757 759 761 767

709 757