| 关于冠图的路分解 |
| |
| 引用本文： | 戚啸虎.关于冠图的路分解[J].淮北煤炭师范学院学报(自然科学版),2014(1):5-7. |
| |
| 作者姓名： | 戚啸虎 |
| |
| 作者单位： | 淮北师范大学数学科学学院,安徽淮北235000 |
| |
| 基金项目： | 安徽省自然科学基金项目（1408085MA08）;安徽省教育厅自然科学基金项目（KJ20132279） |
| |
| 摘 要： | 冠图G°H是由图G和H合成的图,其中使图G的每一个顶点分别与图H的每一个拷贝的所有顶点相连.如果图G的边集合可以分解为若干个边不相交的子图H,那么称G有子图H的分解,当H是P3或P4时,就称G有{P}3,P4分解.文章讨论了一些冠图的{P}3,P4分解问题,得到冠图Pm°Pn、Pm°Cn、Cm°Pn及Cm°Cn存在{P}3,P4分解.
|
| 关 键 词： | 冠图 扇图 轮图 路分解 |
Path Decomposition of Corona Graph |
| |
| QI Xiao-hu.Path Decomposition of Corona Graph[J].Journal of Huaibei Coal Industry Teachers College(Natural Science edition),2014(1):5-7. |
| |
| Authors: | QI Xiao-hu |
| |
| Institution: | QI Xiao-hu ( School of Mathematical Sciences, Huaibei Normal University, 235000, Huaibei,Anhui, China ) |
| |
| Abstract: | Corona graph G°H is composed of G and H synthetic graphs,denoted by G°H .Each vertex of G is respectively connected with every vertice of each copy of H . G is said to have decomposition of sub-graphs H if the edge set of graph G can be decomposed into a number of subgraphs H which the edges dis-joint;G has {P3,P4}-decomposition when H is P3 or P4 .This paper discusses the problem of the path de-composition of some corona graphs and shows that Pm°Pn 、Pm°Cn 、Cm°Pn and Cm°Cn have the{P3,P4}-decomposition. |
| |
| Keywords: | corona graphs fan graph wheel graph path decomposition |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
