Browsing by Author "CHEN, BL"

Now showing 1 - 2 of 2

EDGE DOMINATION IN COMPLETE PARTITE GRAPHS
(1994-09-15)
CHEN, BL
;
FU, HL
;
應用數學系
;
Department of Applied Mathematics
An edge dominating set in a graph G is a set of edges D such that every edge not in D is adjacent to an edge of D. An edge domatic partition of a graph G = (V, E) is a collection of pairwise-disjoint edge dominating sets of G whose union is E. The maximum size of an edge domatic partition of G is called the edge domatic number. In this paper, we study the edge domatic number of the complete partite graphs and give the answers for balanced complete partite graphs and complete split graphs.
TOTAL COLORINGS OF GRAPHS OF ORDER 2N HAVING MAXIMUM DEGREE 2N-2
(1992)
CHEN, BL
;
FU, HL
;
應用數學系
;
Department of Applied Mathematics
Let chi(t)(G) and DELTA(G) denote respectively the total chromatic number and maximum degree of graph G. Yap, Wang and Zhang proved in 1989 that if G is a graph of order p having DELTA(G) greater-than-or-equal-to p - 4, then chi(t)(G) less-than-or-equal-to DELTA(G) + 2. Hilton has characterized the class of graph G of order 2n having DELTA(G) = 2n - 1 such that chi(t)(G) = DELTA(G) + 2. In this paper, we charactarize the class of graphs G of order 2n having DELTA(G) = 2n - 2 such that chi(t)(G) = DELTA(G) + 2.