路和圈的边冠图的路分解

边冠图G□H是由图G和H合成的图,其中使图G的每条边的两端点与图H的一个拷贝的所有顶点相连.如果图G的边集合可以分解为若干个边不相交的子图H,那么称G有子图H的分解,当H是P3或P4时,就称G有{P3,P4}分解.本文讨论了一些边冠图的{P3,P4}分解问题,即:边冠图Pm□Pn、Pm□Cn、Cm□Pn及Cm□Cn存在{P3,P4}分解.

Path Decomposition of Special Edge Corona Graphs

Corona graph C3□P2 is composed of G and H synthetic graphs, denoted by G＆#176;H.The two ends of each of graph G and figure Ha copy of all vertices.G is said to have subgraphs H decomposed if the edge set of graph G can be decomposed into a number of subgraphs H which the edges disjoint;G has P3 ,P4 -decomposition when H is P3 or P4 .This paper discuss the problem of the path decomposition of some edge corona graphs and show that Pm□Pn , Pm□Cn , Cm□Pn and Cm□Cn have the P3 ,P4 -decomposition.