Browsing by Author "Shiue, CL"

Now showing 1 - 5 of 5

Decomposing complete graphs into K-r x K-c's
(2004-02-01)
Fu, HL
;
Hwang, FK
;
Jimbo, M
;
Mutoh, Y
;
Shiue, CL
We consider the problem of decomposing a complete graph into the Cartesian product of two complete graphs K, and K, This problem originated from the clone library screening. We give a general method of constructing such decompositions using various sorts of combinatorial designs. In particular, for r = 3 and c = 3, we show that such a decomposition exists for all n satisfying some simple necessary conditions. (C) 2002 Elsevier B.V. All rights reserved.
On the alpha-labeling number of bipartite graphs
(2000-03-21)
El-Zanati, S
;
Fu, HL
;
Shiue, CL
;
應用數學系
;
Department of Applied Mathematics
In this note we show that the alpha-labeling number of a bipartite graph G is bounded, which proves a conjecture of Snevily. (C) 2000 Elsevier Science B.V. All rights reserved.
On the alpha-labeling number of bipartite graphs
(2000-03-21)
El-Zanati, S
;
Fu, HL
;
Shiue, CL
;
應用數學系
;
Department of Applied Mathematics
In this note we show that the alpha-labeling number of a bipartite graph G is bounded, which proves a conjecture of Snevily. (C) 2000 Elsevier Science B.V. All rights reserved.
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
(2001-09-01)
Fu, HL
;
Shiue, CL
;
Cheng, X
;
Du, DZ
;
Kim, JM
Let a be a permutation of the vertex set V(G) of a connected graph G. Define the total relative displacement of alpha in G by [GRAPHIC] where d(G) (x, y) is the length of the shortest path between x and y in G. Let pi*(G) be the maximum value of delta (alpha)(G) among all permutations of V(G). The permutation which realizes pi*(G) is called a chaotic mapping of G. In this paper, we study the chaotic mappings of complete multipartite graphs. The problem is reduced to a quadratic integer programming problem. We characterize its optimal solution and present an algorithm running in O(n(5) log n) time, where n is the total number of vertices in a complete multipartite graph.
The optimal pebbling number of the complete m-ary tree
(2000-07-28)
Fu, HL
;
Shiue, CL
;
應用數學系
;
Department of Applied Mathematics
In this paper, we find the optimal pebbling number of thr complete m-ary tree. (C) 2000 Elsevier Science B.V. All rights reserved.