223 72 9MB
English Pages 365 [382] Year 2013
Contents Preface
IX
Notation
Xlll
1. Introductory Concepts
1
Mathematical Preliminaries Mathematical Induction Permutations and Combinations Pascal's Triangle and Combinatorial Identities
1 15 25 36
2. Introduction to Graphs and their Uses
47
1.1 1.2 1.3 1.4
2.1 Graphs as Models 2.2 Subgraphs and Types of Graphs 2.3 Isomorphic Graphs 2.4 Graph Operations
3. Trees and Bipartite Graphs 3.1 3.2 3.3 3.4
Properties of Trees Minimum Spanning Trees A Characterization of Bipartite Graphs Matchings and Job Assignments
47
57 64
74
85
85 93 102 107
4. Distance and Connectivity
119
5. Eulerian and Hamiltonian Graphs
143
4.1 Distance in Graphs 4.2 Connectivity Concepts 4.3 Applications
5.1 Characterization of Eulerian Graphs 5.2 Hamiltonicity 5.3 Applications vii
119 129 136 143 151 159