Browsing by Author "FU, HL"

Now showing 1 - 14 of 14

A NOTE ON THE ASCENDING SUBGRAPH DECOMPOSITION PROBLEM
(1990-10-01)
FU, HL
;
交大名義發表
;
應用數學系
;
National Chiao Tung University
;
Department of Applied Mathematics
DISJOINT ODD INTEGER SUBSETS HAVING A CONSTANT ODD SUM
(1994-04-15)
FU, HL
;
HU, WH
;
應用數學系
;
Department of Applied Mathematics
We prove that for positive k, n and m, the set {1, 3,...,2n - 1} of odd integers contains k disjoint subsets having a constant odd sum m if and only if 9(k - 1) less-than-or-equal-to m less-than-or-equal-to 2n - 1, or 9k less-than-or-equal-to m less-than-or-equal-to n2/k and n2 - mk not-equal 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.
EMPIRICAL BAYES ESTIMATIONS FOR SOME DISTRIBUTION FAMILIES
(1994)
HUANG, WT
;
FU, HL
;
PAO, HT
;
應用數學系
;
Department of Applied Mathematics
Some estimates of prior density based on orthogonal expansions are proposed for some family of conditional densities. Their related properties are studied. The associated empirical Bayes estimators are also proposed. Three examples are illustrated and some of its Monte Carlo results are also given.
INFORMATION RATE OF MCELIECE PUBLIC-KEY CRYPTOSYSTEM
(1990-01-04)
LIN, MC
;
CHANG, TC
;
FU, HL
;
應用數學系
;
Department of Applied Mathematics
MORE RESULTS ON THE ORTHOGONAL LATIN SQUARE GRAPHS
(1989-06-01)
FU, HL
;
應用數學系
;
Department of Applied Mathematics
ON PRIME LABELINGS
(1994-03-15)
FU, HL
;
HUANG, KC
;
應用數學系
;
Department of Applied Mathematics
Let G = (V, E) be a graph. A bijection f:V--> {1, 2,...,V} is called a prime labelling if for each e = {u, v} in E, we have GCD(f(u),f(v)) = 1. A graph admits a prime labelling is called a prime graph. Around ten years ago, Roger Entringer conjectured that every tree is prime. So far, this conjecture is still unsolved. In this paper, we show that the conjecture is true for trees of order up to 15, and also show that a few other classes of graphs are prime.
ON THE INTERSECTIONS OF LATIN SQUARES WITH HOLES
(1989-05-01)
FU, CM
;
FU, HL
;
應用數學系
;
Department of Applied Mathematics
PARTITION A GRAPH INTO ASCENDING SUBGRAPHS
(1989-11-01)
HU, WH
;
FU, HL
;
應用數學系
;
Department of Applied Mathematics
THE ACHROMATIC INDEXES OF THE REGULAR COMPLETE MULTIPARTITE GRAPHS
(1995-06-28)
CHIANG, NP
;
FU, HL
;
應用數學系
;
Department of Applied Mathematics
In this paper, we study the achromatic indices of the regular complete multipartite graphs and obtain the following results: (1) A good upper bound for the achromatic index of the regular complete multipartite graph which gives the exact values of an infinite family of graphs and solves a problem posed by Bouchet. (2) An improved Bouchet coloring which gives the achromatic indices of another infinite family of regular complete multipartite graphs.
THE INTERSECTIONS OF COMMUTATIVE LATIN SQUARES
(1991-12-01)
FU, CM
;
FU, HL
;
GUO, SH
;
應用數學系
;
Department of Applied Mathematics
A latin square of order n is an nxn array such that each of the integers 1,2,...,n (or any set of n distinct symbols) occurs exactly once in each row and each column. A latin square L = [l(i),j] is said to be commutative provided that l(i),j = l(j),i for all i and j. Two latin squares, L = [l(i),j] and M = [m(i),j], are said to have intersection k if there are exactly k cells (i,j) such that l(i),j = m(i),j. Let I[n] = {0,1,2,...,n2-9,n2-8,n2-6,n2}, H[n] = I[n] union {n2-7,n2-4}, and J[n] be the set of all integers k such that there exists a pair of commutative latin squares of order n which have intersection k. In this paper, we prove that J[n] = I[n] for each odd n greater-than-or-equal-to 7, J[n] = H[n] for each even n greater-than-or-equal-to 6, and give a list of J[n] for n less-than-or-equal-to 5. This totally solves the intersection problem of two commutative latin squares.
THE LINEAR 2-ARBORICITY OF COMPLETE BIPARTITE GRAPHS
(1994-12-01)
FU, HL
;
HUANG, KC
;
應用數學系
;
Department of Applied Mathematics
A forest in which every component is path is called a path forest. A family of path forests whose edge sets form a partition of the edge set of a graph G is called a path decomposition of a graph G. The minimum number of path forests in a path decomposition of a graph G is the linear arboricity of G and denoted by l(G). If we restrict the number of edges in each path to be at most k then we obtain a special decomposition. The minimum number of path forests in this type of decomposition is called the linear k-arboricity and denoted by la(k)(G). In this paper we concentrate on the special type of path decomposition and we obtain the answers for la2(G) when G is K(n,n). We note here that if we restrict the size to be one, the number la1(G) is just the chromatic index of G.
THE MUTUAL INTERSECTIONS OF 3 DISTINCT 1-FACTORIZATIONS
(1989-12-01)
FU, CM
;
FU, HL
;
應用數學系
;
Department of Applied Mathematics
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.