| 两类特殊图的最优填充 |
| |
| 引用本文： | 韦新,;罗海鹏,;邓天炎.两类特殊图的最优填充[J].广西师院学报,2008(1):25-27. |
| |
| 作者姓名： | 韦新 ;罗海鹏 ;邓天炎 |
| |
| 作者单位： | [1]广西师范学院数学与计算机科学系,广西南宁530001; [2]广西科学院,广西南宁530007 |
| |
| 基金项目： | 国家自然科学基金项目（60563008）;广西自然科学基金项目（桂科自0728051） |
| |
| 摘 要： | 运用图的最优填充分解定理，将强乘积图P3×Pn，P2×Pn与乘积图P2×Pn^2进行分解，得到了它们的最优填充数．
|
| 关 键 词： | 填充 强乘积图 乘积图 |
The Fill - in Number of Two Special Graphs |
| |
| Institution: | WEI Xin , LUO Hai-peng, DENG Tian-yan (1. Department of Mathematics and Computer Science,Guangxi Teachers Education University, Nanning 530001, China; 2. Guangxi Academy of Scienes, Nanning 530007, China) |
| |
| Abstract: | By using the decomposition theorem for the fill- in of graphs, we can deeomposite the strong product of graphs together with product graph, and obtain the fill - in number of them. |
| |
| Keywords: | fill - in strong product graph product graph |
| 本文献已被 维普 等数据库收录！ |
|
