| E—S不可收缩图的计数 |
| |
| 引用本文： | 樊锁海. E—S不可收缩图的计数[J]. 暨南大学学报(自然科学与医学版), 1996, 17(3): 27-32 |
| |
| 作者姓名： | 樊锁海 |
| |
| 作者单位： | 暨南大学数学系 |
| |
| 基金项目： | 暨南大学青年科学基金,国家自然科学青年基金 |
| |
| 摘 要： |
|
| 关 键 词： | E－S不可收缩图 圈指标 分裂图 计数 图论 |
Enumeration of E-S Unretractive Graphs |
| |
| Fan Suohai. Enumeration of E-S Unretractive Graphs[J]. Journal of Jinan University(Natural Science & Medicine Edition), 1996, 17(3): 27-32 |
| |
| Authors: | Fan Suohai |
| |
| Abstract: | A graph X is said to be E-S unretractive if every endomorphism of X is string. Thestructure of E-S unret.fsctive graphs was charaderied. The enutheration of thaisgraphs are given herein by using Polya's counting theorem. |
| |
| Keywords: | E-S unretractive graphs split cycle index partition duplicate permutation |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
