G = S(I K, E) ∆(G) ≥ max {deg(u) | u ∈ I}+ |K| 1 CHROMATIC INDEX OF SPLIT GRAPHS G = S(I K, E) WITH ∆(G) ≥ max {deg(u) | u ∈ I}+ |K| 1 ác giả edu vn óm tắt t G = (V, E) c g i t tác c c t t i c V =[.]
G = S(I K, E) ∆(G) ≥ max {deg(u) | u ∈ I}+ |K| - CHROMATIC INDEX OF SPLIT GRAPHS G = S(I K, E) WITH ∆(G) ≥ max {deg(u) | u ∈ I}+ |K| - ác giả: edu.vn óm tắt: t G = (V, E) cg i t tác c c t t i c V=IK c t c c G cảm i trê I t r g t c c G cảm i trê K t g t i t tác c c ó S(I K, E) i m t tác c c c g m i mm r ác t g c g iê c i i c g có iê t c má t i t ó g gói tr g i c g ê t t m tr i g iê c m ,… r g i m t i i t tác c c t c l m t cc g mi c i t c gt ác ắc c c t tác c c G = S(I K, E) i ∆(G) ≥ m { g(u) | u ∈ I}+ |K| - c g mi c r g ắc c c t ∆(G) k óa: S a Abstract: A graph G = (V, E) is called a split graph if there exists partition V = I K in such a way that the subgraphs of G induced by I and K are empty and complete, respectively We will denote such a graph by S(I K, E) The notion of split graphs was introduced in 1977 by S Foldes and P.L Hammer These graphs have also been paid attention to because they have connection with packing and knapsach problems, with the matroid theory, with Boolean function, … t i r some sufficient conditions for split graphs to be Class one are proved In particular, we determine chromatic index of split graphs G = S(I K, E) with ∆(G) ≥ m { g(u) | u ∈ I}+ |K| - We show that chromatic index of G is ∆(G) Key words: Split graph; Edge coloring; Chromatic index; Class one graph; Class two graph