关于图的P3和P4分解-应用数学专业论文.docxVIP

I I 关于图的?3和?4分解 摘要: 本文所研究的图均是有限、无向的简单图，即没有环和重边的图. 目 前，把图分解为给定路长的路分解问题的研究较为广泛. 所谓路分解就是一个 路集合使图中每条边都恰好出现在其中的一条路上. 路分解也是解决图论难题 的一个重要工具之一. 我们利用图的路分解可以把复杂的问题简单化，因此研 究路分解是很有意义的. 如果一个图?的边集合可以分解为若干个不相交的子图?时，那么就称图? 有子图?分解，当这里的子图?是?3或?4时，则称图?存在{?3, ?4}分解. 本文主要针对一些冠图和边冠图存在{?3, ?4}分解问题进行研究，根据扇 图、轮图和星图存在{?3, ?4}分解的结论，证明了路与圈的冠图和边冠图; 扇图 与路的冠图和边冠图; 轮图与圈的冠图和边冠图; 扇图与扇图的冠图和边冠图 以及轮图与轮图的冠图和边冠图等等均存在{?3, ?4}分解. 关键词: 扇图; 轮图; 冠图; 边冠图; 路分解 I II The ?3 and ?4 decomposition of graphs Abstract: The simple graphs which this paper researches are all finite、undirect- ed, and they don,t have the circle and overlap edges. At present, the problem that graph is decomposed paths with given length is researched widely. The path decom- posed of a graph is that a set of paths which each edge exactly appears in one of the paths. The path decomposition is a very important tool to solve graph theory problem. We can use the decomposition of graph to make complex problem more simple, so studying path decomposition is extremely significant. G is said to have subgraphs H decomposed if the edge set of graph G can be de- composed into a number of subgraphs H which the edges disjoint, and G has {?3, ?4}- decomposition when H is ?3 or ?4. This paper mainly researches some corona graphs and edge corona graphs which exist the problem of {?3, ?4}-decomposition, and according to fan graphs、wheel graphs and star graphs have {?3, ?4}-decomposition, we show that corona graph and edge corona graph between path and circle; corona graph and edge corona graph between fan graphs and path; corona graph and edge corona graph between wheel graphs and circle; corona graph and edge corona graph between fan graphs and fan graphs; corona graph and edge corona graph between wheel graphs and wheel graphs, have the {?3, ?4}-decomposition. Key Words: Fan graph; Wheel graph; Corona graph; Edge corona graph; path decomposition I III 目 录 第一章 绪论 1 1.1 研究背景 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1