| 若干图联图的边联结数 |
| |
| 引用本文： | 张建勋,张忠辅,陈东灵. 若干图联图的边联结数[J]. 山东科技大学学报(自然科学版), 1991, 0(2) |
| |
| 作者姓名： | 张建勋 张忠辅 陈东灵 |
| |
| 作者单位： | 兰州铁道学院，兰州铁道学院，山东矿业学院 |
| |
| 摘 要： | 本文研究了路、圈、完全图相互间经过联运算以后所得图的边联结数,得到了Lm(?)Ln,Cm(?)Cn,Lm(?)Cn,Lm(?)Kn和Cm(?)Kn的边联结数的计算公式,这里Lx,Cx,Kx分别表示有x个点的路、圈、完全图。
|
| 关 键 词： | 图论 路 圈 联 图 |
THE EDGE-BINDING NUMBER OF JOIN GRAPHS OF SOME GRAPHS |
| |
| Chen Dong Ling. THE EDGE-BINDING NUMBER OF JOIN GRAPHS OF SOME GRAPHS[J]. Journal of Shandong Univ of Sci and Technol: Nat Sci, 1991, 0(2) |
| |
| Authors: | Chen Dong Ling |
| |
| Affiliation: | (Zhang Jianxun zhang zhongfu) Chen Dong Ling (La zhou Railway Institute) (Shardorg Minning Istitute) |
| |
| Abstract: | This paper discusses the edge-binding number of graph derived through the joint calculations betwee path, cycle and complete graph and the calculating equations of edge-binding numbers for LmLn, Cmn, LmCn, LmKn and CmKn are obtained, were Lx, Cx, Kx respectively denote the path, cycle and complete graph with x points. |
| |
| Keywords: | graph theory path cycle join graph |
| 本文献已被 CNKI 等数据库收录！ |
|
