离散数学引论
¥
25.95
7.6折
¥
34
九五品
仅1件
作者(美)安德逊 著
出版社清华大学出版社
ISBN9787302214823
出版时间2009-11
版次1
装帧平装
开本16开
纸张胶版纸
页数200页
定价34元
上书时间2024-05-08
商品详情
- 品相描述:九五品
- 商品描述
-
基本信息
书名:离散数学引论
定价:34.00元
作者:(美)安德逊 著
出版社:清华大学出版社
出版日期:2009-11-01
ISBN:9787302214823
字数:
页码:200
版次:1
装帧:平装
开本:16开
商品重量:
编辑推荐
内容提要
本书以简洁和通俗的形式介绍组合数学的一些本质性内容:图论的重要问题,计数方法和试验设计,其中图论约占一半篇幅。书中有大量习题和例题,习题附有部分解答和提示,适于自学。本书可用作数学、计算机科学、信息科学专业大学本科生的组合数学教材,可在大学一年级讲授。
目录
Contents1. Counting and Binomial Coefficients 1.1 Basic Principles 1.2 Factorials 1.3 Selections 1.4 Binomial Coefficients and Pascal's Triangle 1.5 Selections with- --Repetitions 1.6 AUsefulMatrixInversion2. Recurrence 2.1 Some Examples 2.2 The Auliary Equation Method 2.3 Generating Fhnctions 2.4 Derangements 2.5 Sorting AlgorithmsContents1. Counting and Binomial Coefficients 1.1 Basic Principles 1.2 Factorials 1.3 Selections 1.4 Binomial Coefficients and Pascal's Triangle 1.5 Selections with- --Repetitions 1.6 AUsefulMatrixInversion2. Recurrence 2.1 Some Examples 2.2 The Auliary Equation Method 2.3 Generating Fhnctions 2.4 Derangements 2.5 Sorting Algorithms 2.6 Catalan Numbers3. Introduction to Graphs 3.1 The Concept of a Graph 3.2 Paths in Graphs 3.3 Trees 3.4 Spanning Trees 3.5 Bipartite Graphs 3.t5 Planarity 3.7 Polyhedra.4. Travelling Round a Graph 4 1 Hamiltonian Graphs 4.2 Planarity and Hamiltonian Graphs 4.3 The Travelling Salesman Problem 4.4 Gray Codes 4.5 EulerianDigraphs5. Partitions and Colourings 5.1 Partitions of a Set 5.2 StirlingNumbers 5.3 Counting Functions 5.4 Vertex Colourings of Graphs 5.5 Edge Colourings of Graphs 6 The Inclusion-Exclusion Principle 6.1 The Principle 6.2 Counting Surjections 6.3 Counting Labelled Trees 6.4 Scrabble. 15.5 The MSnage Problem 7. Latin Squares and Hall's Theorem. 7.1 Latin-Squares and -Orthogonality 7.2 Magic Squares 7.3 Systems of Distinct Representatives 7.4 From Latin Squares to Affine Planes8 Schedules and 1-Factorisations 8.1 The Circle Method 8.2 Bipartite Tournaments and 1-Factorisations of Kn 8.3 Tournaments from Orthogonal Latin Squares9. Introduction to Designs. 9.1 Balanced Incomplete Block Designs 0.2 Resolvable Designs 0.3 Finite Projective Planes 0.4 Hadamard Matrices and Designs 0.15 Difference Methods 9.15 Hadamard Matrices and CodesAppendixSolutions Further ReadingBibliographyIndex显示全部信息
作者介绍
序言
— 没有更多了 —
以下为对购买帮助不大的评价