Norman L. Biggs: Discrete Mathematics
Mathe
Inhaltsverzeichnis
- Integers
- Functions and counting
- Principles of counting
- Subsets and designs
- Partition, classification, and distribution
- Modular arithmetic
- Algorithms and their efficiency
- Graphs
- Trees, sorting, and searching
- Bipartite graphs and matching problems
- Digraphs, networks, and flows
- Recursive techniques
- Groups
- Groups of permutations
- Rings, field, and permutations
- Finite fields and some applications
- Error-correcting codes
- Generating functions
- Partitions of a positive integer
- Symmetry and counting
Amazon.deAmazon.com