Halin图的边覆盖染色-应用数学专业毕业论文.pdfVIP

河北工业大学硕士学位论文 Halin 图的边覆盖染色 I商 要 设 图 G(V1E ) 是简单图，其 中 V ( G ) 和 E (G ) 是图的顶点集和边 集. C 是边集 E 到 集 合 {1,2, ••• ,fc} 的映射 ：C : E — {1,2, ••• ,k}, 称 C 是 图 G 的 边 染 色 . 令 Ci(W) 为 染 色 C 中与 顶 点v 关联的 i 色边的数目. 若 对 V 中每个顶点W 及每种颜色 i € {1,2,… ，k } 都 有 C1(V) 1 , 则 称 C 为 图 G 的边覆盖染色. 使 G 有边覆盖染色所 需 最 大 称 为 图 G 的边覆盖色数，用 xC(G) 表示.对简单图已知 占 -1 Xc(G) 6, xC(G) = 5 的 图 称 为 C l 类图，否 则 称 为 C I I 类图. 讨论了基于边覆盖色数的H a lin 图的分类问题，得到了 Halin 图为C l 的充要条件：Halin 图 G 为 C l 类 图 当 且 仅 当 |五(G)|. : , , Halin Halin 圈的边覆盖染色 O N E D G E -C O V E R C O LO R ING OF H A LI N G R A P H A B ST R A C T Let G(V, E) be a simple graph with vertex set V(G) and edge set E(G). C is a mapping from E(G) to {1, 2 , k}, that is C : E — {1, 2 , .. ., k}, C is called a k-edge-coloring of G. Let Ci(v) be the number of edges of G incident with vertex v receiving color i in coloring C . C is called a k- edge cover-coloring of G if Ci(v) 1 for each v G V , and i G {1, 2 , k}. The maximum positive integer k for which G has a k-edge cover-coloring is called the edge cover chromatic index of G. It is denoted by xC(G)- For simple graph, it is known that 5 — 1 xC(G) 5. G is of class C I if xC(G) = 5, otherwise G is of class C I I . We discuss the classification of Halin graph based on the edge cover chromatic index and obtain a necessary and sufficient condition for Halin graph to be of class CI: a Halin graph G is of class Cl if and only if J \E(G)\. K E Y W O R D S: edge coloring, edge-cover coloring, Halin graph