Browsing by Author "HWANG, SF"

Now showing 1 - 4 of 4

ANALYSIS OF LARGE DEFORMATION OF A HEAVY CANTILEVER
(1988-07-01)
HSU, SB
;
HWANG, SF
;
應用數學系
;
Department of Applied Mathematics
EDGE DOMATIC NUMBERS OF COMPLETE N-PARTITE GRAPHS
(1994)
HWANG, SF
;
CHANG, GJ
;
應用數學系
;
Department of Applied Mathematics
An edge dominating set of a graph is a set of edges D such that every edge not in D is adjacent to an edge in 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 of G. In this paper we study the edge domatic numbers of complete n-partite graphs. In particular, we give exact values for the edge domatic numbers of complete 3-partite graphs and balanced complete n-partite graphs with odd n.
ON THE SINGULAR BEHAVIOR OF THE SOLUTION OF V''(X) + X SIN V(X) = O
(1992-01-01)
CHENG, KS
;
HSU, SB
;
HWANG, SF
;
應用數學系
;
Department of Applied Mathematics
THE K-NEIGHBOR DOMINATION PROBLEM
(1991-06-17)
HWANG, SF
;
CHANG, GJ
;
應用數學系
;
Department of Applied Mathematics
As a model of certain location problem, we consider the following domination problem. The k-neighbor domination problem is to select a minimum cardinality vertex set D of a graph G = (V, E) such that every vertex x not in D is adjacent to at least k vertices in D. This paper presents a linear algorithm to solve the problem for block graphs. For any fixed k, we also prove that the k-neighbor domination problem is NP-complete for some classes of graphs.