Discrete Mathematics with Graph TheoryPrentice Hall, 1998 - 527 páginas Adopting a user-friendly, conversational and at times humorous style, these authors make the principles and practices of discrete mathematics as much fun as possible while presenting comprehensive, rigorous coverage. Starts with a chapter "Yes, There Are Proofs" and emphasizes how to do proofs throughout the text. |
Índice
SETS AND RELATIONS | 20 |
FUNCTIONS | 63 |
THE INTEGERS | 96 |
Página de créditos | |
Otras 18 secciones no se muestran.
Términos y frases comunes
a₁ adjacency matrix algorithm Answers to Pauses assume b₁ bipartite graph boxes C₁ chromatic number comparisons complete congruence connected graph contains corresponding Cube defined DEFINITION denote depth-first search determine digits digraph Dijkstra's algorithm directed network divisible edges incident elements equivalence relation Eulerian circuit example Exercise Explain extended bases FIGURE Find flow function G₁ given graph G graph shown Hamiltonian cycle Hamiltonian path hence induction hypothesis integers isomorphic Kruskal's algorithm least marbles Mathematical Induction maximum minimum spanning tree multiplication natural numbers number of edges obtain one-to-one output pair partition permutations planar graph polynomial possible prime Problem proof Proposition Prove pseudograph real numbers recurrence relation Section sequence shortest path Show shown in Fig solution Step strongly connected orientation subgraph subsets Suppose Theorem tournament triangle true U,C-fragments V₁ vertex