Browsing by Author "Huang, Kuo-Ching"

Now showing 1 - 6 of 6

A note on optimal pebbling of hypercubes
(2013-05-01)
Fu, Hung-Lin
;
Huang, Kuo-Ching
;
Shiue, Chin-Lin
;
應用數學系
;
Department of Applied Mathematics
A pebbling move consists of removing two pebbles from one vertex and then placing one pebble at an adjacent vertex. If a distribution delta of pebbles lets us move at least one pebble to each vertex by applying pebbling moves repeatedly(if necessary), then delta is called a pebbling of G. The optimal pebbling number f'(G) of G is the minimum number of pebbles used in a pebbling of G. In this paper, we improve the known upper bound for the optimal pebbling number of the hypercubes Q (n) . Mainly, we prove for large n, by a probabilistic argument.
Antimagicness of star forests
(2020-03-01)
Chen, Zhen-Chun
;
Huang, Kuo-Ching
;
Lin, Chiang
;
Shang, Jen-Ling
;
Lee, Ming-Ju
An edge labeling of a graph G is a bijection f : E(G) {1, 2, " " ", 1E(G)1}. The induced vertex sum f+ of f is a function defined on V(G) given by f+ (u) = E(G) f(uv) for all u E V(G). The value f+(u) is called the vertex sum at u. The graph G is called antimagic if there exists an edge labeling of G such that the vertex sums at all vertices of G are distinct. A star forest is the union of disjoint stars. Let S denote a star with n edges, and mS denote a star forest consisting of the disjoint m copies of S. It is known that mS2 is antimagic if and only if m = 1. In this study, a necessary condition and a sufficient condition are obtained whereby a star forest mS2 U Snr U Snz U " " " U Sn, (ni, n2, " " ", nk > 3) may be antimagic. In addition, a necessary and sufficient condition is obtained whereby a star forest mS2 US (n > 3) may be antimagic. Moreover, a graph consisting of disjoint stars together with an extra disjoint path is also verified to be antimagic.
Nanoscale p-MOS Thin-Film Transistor With TiN Gate Electrode Fabricated by Low-Temperature Microwave Dopant Activation
(2010-05-01)
Lu, Yu-Lun
;
Hsueh, Fu-Kuo
;
Huang, Kuo-Ching
;
Cheng, Tz-Yen
;
Kowalski, Jeff M.
In this letter, nanoscale p-MOS TFTs with a TiN gate electrode were realized using a novel microwave (MW) dopant-activation technique. We compared both low-temperature MW annealing and rapid thermal annealing. We successfully activated the source/drain region and suppressed the short-channel effects using low-temperature MW annealing. This technique is promising from the viewpoint of realizing high-performance and low-cost upper layer nanoscale transistors required for low-temperature 3-D integrated circuit fabrication.
Pack Graphs with Subgraphs of Size Three
(2018-02-01)
Chen, Zhen-Chun
;
Fu, Hung-Lin
;
Huang, Kuo-Ching
;
應用數學系
;
Department of Applied Mathematics
An H -packing F of a graph G is a set of edge -disjoint subgraphs of G in which each subgraph is isomorphic to H. The leave L or the remainder graph L of a packing F is the subgraph induced by the set of edges of G that does not occur in any subgraph of the packing F. If a leave L contains no edges, or simply L = Phi, then G is said to be H -decomposable, denoted by H broken vertical bar G. In this paper, we prove a conjecture made by Chartrand, Saba and Mynhardt [13]: If G is a graph of size q(G) 0 (mod 3) and delta(G) >= 2, then G is H -decomposable for some graph H of size 3.
The Hamilton-Waterloo problem for two even cycles factors
(2008-07-01)
Fu, Hung-Lin
;
Huang, Kuo-Ching
;
應用數學系
;
Department of Applied Mathematics
This paper investigates the problem of factoring K(2n) - I(n), into 2-factors of two kinds or three kinds: (1) C(t)-factors and C(2t)-factors, (2) C(4)-factors and C(2t)-factors, (3) C(4)-factors, C(8)-factors and C(16)-factors.
The linear 3-arboricity of Kn,n and Kn
(2008-09-06)
Fu, Hung-Lin
;
Huang, Kuo-Ching
;
Yen, Chih-Hung
;
應用數學系
;
Department of Applied Mathematics
A linear k-forest is a forest whose components are paths of length at most k. The linear k-arboricity of a graph G, denoted by la(k) (G), is the least number of linear k-forests needed to decompose G. In this paper, we completely determine lak (G) when G is a balanced complete bipartite graph K-n,K-n or a complete graph K-n, and k = 3. (C) 2007 Elsevier B.V. All rights reserved.