Introductory Discrete MathematicsPrentice Hall, 1991 - 236 páginas This overview of discrete mathematics places special emphasis on combinatorics, graph theory and two important topics in network optimization with an algorithmic approach. The text provides a discussion of basic combinatorics and graph theory, with several combinational models. |
Índice
Combinatorics | 35 |
Generating Functions | 80 |
Recurrence Relations | 94 |
Página de créditos | |
Otras 6 secciones no se muestran.
Otras ediciones - Ver todo
Términos y frases comunes
a₁ adjacency matrix algorithm to solve allocating arbitrary binary tree called cardinality Chapter coefficient color combinatorial complexity compound proposition connected graph consider cutset decision problem defined delete denoted digraph distinct objects empty set equal equivalence relation Eulerian circuit Eulerian path Example exponential generating function Figure Find the number finite set graph G graph theory Hamiltonian cycle Hamiltonian path indegree induction initial conditions intersection Iteration least letters linear marbles maximal element n₁ n₂ natural numbers nonnegative integers number of edges number of elements number of multiplications number of solutions number of vertices obtain optimization problem ordinary generating function outdegree pair of vertices partition permutations pigeonhole polynomial algorithm positive integers Proof Prove real numbers recurrence relation represent root sequence simple graph solutions in nonnegative spanning tree subgraph Suppose surjection THEOREM total number tournament true unique v₁ variable vertex weight word