Closure Concepts and Applications in Discrete Mathematics
[1]WU Mingfen,QU Yunyun.Closure Concepts and Applications in Discrete Mathematics[J].Journal of Zhengzhou University (Engineering Science),2012,33(05):133-137.[doi:10.3969/j.issn.1671-6833.2012.05.030]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
33卷
Number of periods:
2012 05
Page number:
133-137
Column:
Public date:
2012-09-10
- Title:
- Closure Concepts and Applications in Discrete Mathematics
- Keywords:
- closure; binary relation; subspace; undirected graph; connected graph; generating subgroup; shortest path
- CLC:
- TP301.60158
- DOI:
- 10.3969/j.issn.1671-6833.2012.05.030
- Abstract:
- We make a thorough inquiry about the coneepts in diserete mathematics based on the amplifieationand minimum features of the closure. We collected some explicit concepts and implicit concepts of closurefrom discrete mathematics such as closures of binary relation ,strong part graph ,subspace sum subspace sgener.ating subgroup and so on, Trying to format the teaching of these concepts and procedure standardization in theframework of the closure, At the same time, we introduce our teaching programs and techniques. Finally, thethinking of relationship transitive closure is applied to the algorihm design of the shortest path and Euler roads.
- References:
- -
- Similar References:
Memo
-
Last Update:
1900-01-01