Browsing by Author "Huang, HM"

Now showing 1 - 4 of 4

The super connectivity of the pancake graphs and the super laceability of the star graphs
(2005-06-12)
Lin, CK
;
Huang, HM
;
Hsu, LH
;
資訊工程學系
;
Department of Computer Science
A k-containerC(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) of G is a k*-container if it contains all the vertices of G. A graph G is k*-connected if there exists a k*-container between any two distinct vertices. Let kappa(G) be the connectivity of G. A graph G is super connected if G is i*-connected for all 1 <= i <= kappa(G). A bipartite graph G is k*-laceable if there exists a k*-container between any two vertices from different parts of G. A bipartite graph G is super laceable if G is i*-laceable for all 1 <= i <= kappa(G). In this paper, we prove that the n-dimensional pancake graph P(n) is super connected if and only if n not equal 3 and the n-dimensional star graph S(n) is super laceable if and only if n not equal 3. (c) 2005 Elsevier B.V. All rights reserved.
The super laceability of the hypercubes
(2004-10-16)
Chang, CH
;
Lin, CK
;
Huang, HM
;
Hsu, LH
;
資訊工程學系
A k-container C(u, v) of a graph G is a set of k disjoint paths joining u to v. A k-container C(u, v) is a k*-container if every vertex of G is incident with a path in C(u, v). A bipartite graph G is k*-laceable if there exists a k*-container between any two vertices u, v from different partite set of G. A bipartite graph G with connectivity k is super laceable if it is i*-laceable for all i less than or equal to k. A bipartite graph G with connectivity k is f-edge fault-tolerant super laceable if G - F is i*-laceable for any 1 less than or equal to i less than or equal to k - f and for any edge subset F with F = f < k - 1. In this paper, we prove that the hypercube graph Q(r) is super laceable. Moreover, Qr is f-edge fault-tolerant super laceable for any f less than or equal to r - 2. (C) 2004 Elsevier B.V. All rights reserved.
Transesterification in homogeneous poly(epsilon-caprolactone)-epoxy blends
(1999-01-03)
Chen, JL
;
Huang, HM
;
Li, MS
;
Chang, FC
;
應用化學系
Transesterification has been investigated in poly(epsilon-caprolactone) (PCL)-epoxy blends. In the hot melt process, the hydroxyl on diglycidyl ether of bisphenol-il (DGEBA) monomers is too low to give a noticeable transesterification reaction. In the postcure process, model reactions reveal that the hydroxyls from a ring-opening reaction are able to react with the esters of PCL. In the meantime, the PCL molecular weight decrease and its distribution becomes broader. Nuclear magnetic resonance spectra reveal that fraction of the tertiary hydroxyls converts to secondary hydroxyls. In the cured DGEBA-3,3'-dimethylmethylene-di(cyclohexylamine)-PCL blend, a homogeneous morphology is achieved. PCL segments are grafted onto the epoxy network after postcuring and result in the lower T-g observed in the differential scanning calorimetry thermogram. A higher transesterification extent also results in broader transition peaks by dynamic mechanical analysis. (C) 1999 John Wiley & Sons, Inc.
Using transforming matrices to generate DNA clone grids
(2003-08-01)
Huang, HM
;
Hwang, FK
;
Ma, HF
;
應用數學系
;
Department of Applied Mathematics
Ina yeast artificial chromosome library, DNA clones may be stored in n-dimensional grids. Barillot, Lacroix and Cohen proposed to use the grid lines as pools in a pooling design (used in physical mapping). To screen the clones in a given grid, they noted that it is important to take several copies of the grid, but rearrange the clones such that two clones are in the same grid line at most once. For ease of implementation, biologists proposed using transforming matrices to transform one copy into another. We give a construction of a set of transforming matrices which produce a maximum number of such copies whenever q is a prime power. (C) 2003 Elsevier B.V. All rights reserved.