摘要
从关系矩阵的角度对离散数学中二元关系的逆、复合、并和幂等4种运算进行研究和分析,简化了相关定理的证明.给出非负整数列可图化定理的一个等价条件,进而得到了判断非负整数列可图化的一种简便方法.
By using relation matrix,researched the inverse,compound operation,union and power operations of binary relation in an innovative way,which simplifies the proofs of relevant theorems.Additionally,obtained an equivalent condition of a theorem in the textbook,which derives a simpler method to decide whether a non-negative integer sequence can be a degree sequence.
出处
《高师理科学刊》
2015年第12期18-21,共4页
Journal of Science of Teachers＇College and University
基金
华中农业大学校级重点课程建设项目(2014024)
关键词
离散数学
二元关系的运算
非负整数列
度序列
discrete mathematics
operations of binary relation
non-negative integer sequence
degree sequence
