| 关于图论中一个定理的证明 |
| |
| 引用本文： | 黄明嚖.关于图论中一个定理的证明[J].华南师范大学学报(自然科学版),1988,0(2):1. |
| |
| 作者姓名： | 黄明嚖 |
| |
| 作者单位： | 华南师范大学物理系 |
| |
| 摘 要： | 在图论的教科书和专著中,对图论的重要定理“在简单有向图G中,它的每一个结点位于且只位于一个强分图中”的证明,均采用图论中一般方法.本文试用集合论中等价关系的方法予以证明,此方法具有数学的严谨性.
|
| 关 键 词： | 有向图 强连通 等价关系 集合的划分 商集 等价类 |
ON THE PROOF OF A THEOREM IN GRAPH THEORY |
| |
| Huang Minhui.ON THE PROOF OF A THEOREM IN GRAPH THEORY[J].Journal of South China Normal University(Natural Science Edition),1988,0(2):1. |
| |
| Authors: | Huang Minhui |
| |
| Abstract: | In the present texthooks and works of graph theory, the main theorem in graph theory. In a simple directed graph G, its every knot is located and only located in a strong subgraph, is usually proved by the routin method. It can, however, be proved by the equivalent relation method of set theory, which has the advantage of mathematical rigour. |
| |
| Keywords: | directed graph strong connection equivalent relation divison set eguivalent class |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《华南师范大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《华南师范大学学报(自然科学版)》下载免费的PDF全文 |
