| 几类图的联结数 |
| |
| 引用本文： | 陈东灵. 几类图的联结数[J]. 山东科技大学学报(自然科学版), 1992, 0(1) |
| |
| 作者姓名： | 陈东灵 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系 |
| |
| 摘 要： | 本文给出了若干完全图的联(nK_r+mK_s),圈、路和完全二部图分别与完全图的补图的字典式积(C_m(K_n)、L_m(K_n)和K_(a,b))以及完全r—部图(K_(n1,n2,…nr))等几类图的联结数。
|
| 关 键 词： | 图 联 联结数 字典式积 |
THE BINDING NUMBER OF SOME GRAPHS |
| |
| Chen Dongling. THE BINDING NUMBER OF SOME GRAPHS[J]. Journal of Shandong Univ of Sci and Technol: Nat Sci, 1992, 0(1) |
| |
| Authors: | Chen Dongling |
| |
| Affiliation: | Dept. of Appl. Math. & Software Eng. |
| |
| Abstract: | In this paper, the binding number of the following types of graphs are given: the lexicographic product consisting of the join of some complete graphs (nK_r+mK_s), the circuit, path, complete bipartite graph to the complement ary graph of complete graphs respectively (C_m((?)_n) , L_m((?)_n), K_(a,b)((?)))as, wall as the complete r-partite graph(K_(n1, n2, ..., nr)). |
| |
| Keywords: | graph:join binding number lexicographic product |
| 本文献已被 CNKI 等数据库收录！ |
|
