Yung-Ling Lai

Learn More
AIM Esomeprazole, an oral S-form of omeprazole, has been a greater acid inhibitor over omeprazole in treating acid-related diseases. Only less published data is available to confirm its efficacy for Asian people. Therefore, a perspective, double-blind, randomized comparison of esomeprazole tablets 40 mg (Nexium) vs omeprazole capsules 20 mg (Losec) in(More)
BACKGROUND AND PURPOSE Reflux esophagitis of Los Angeles grade A or B is more common than grades C and D disease among Taiwanese. This study compared the efficacy of esomeprazole 40 mg and omeprazole 20 mg for starting on-demand therapy for grade A and B reflux esophagitis. METHODS 100 patients with grade A and B reflux esophagitis were randomized to(More)
Let ( ) , G V E = be a graph of order n. A Hamiltonian cycle of G is a cycle contains every vertex in G. Two Hamiltonian cycles 1 1 2 3 1 , , ,... , n C u u u u u = and C2 = 1 2 3 1 , , ,... , n v v v v v of G are independent if 1 1 u v = and i i u v ≠ for 2 i n ≤ ≤ . A set of Hamiltonian cycles { } 1 2 3 , , ,... k C C C C of G is mutually independent if(More)
The graph bandwidth problem is a well-known NP-complete problem. The relation between size of a graph and bandwidth is very interesting. The minimum size required in G with bandwidth B is denoted as m(n, B) while the graph G of order n and bandwidth B with size m(n, B) is called an extremal graph. This paper provides the minimum size for a graph of odd(More)
Graph bandwidth problem has been studies for over forty years. The relation between the bandwidth and number of edges in the graph is always interesting. The edge addition number ad(G) of a graph is the minimum number of edges that added into the graph G which cause the resulting graph’s bandwidth greater than the bandwidth of G. This paper determines the(More)
For a graph ( ) , G V E = , let and denote the set of vertices that are at distance one and two from respectively. A subset 1( ) N v 2 ( ) N v v ( ) D V G ⊆ is said to be a -dominating set of if every vertex 3,2,1 D G v V ∈ satisfies ( ) 3 D w v ≥ where ( ) D w v = 3 { } v D ∩ + 2 ( ) 1 N v D ∩ + ( ) 2 N v D ∩ . The minimum cardinality of a -dominating set(More)
For a connected graph ( , ) G V E = , a node ranking labeling { } : 1, 2,... C V k → is a mapping such that for every path between any two vertices u , v with ( ) ( ) C u C v = , there exists at least one vertex w on the path with ( ) ( ) ( ) C w C u C v > = . The value ( ) C v is called the rank of the vertex v and G is said to be k-rankable if there(More)