Highly uniform and conformal coatings can be made by the alternating exposures of a surface to vapors of two reactants, in a process commonly called atomic layer deposition (ALD). The application of ALD has, however, been limited because of slow deposition rates, with a theoretical maximum of one monolayer per cycle. We show that alternating exposure of a surface to vapors of trimethylaluminum ...

We will present a new method, which enables us to find threshold functions for many properties in random intersection graphs. This method will be used to establish sharp threshold functions in random intersection graphs for k–connectivity, perfect matching containment and Hamilton cycle containment. keywords: random intersection graph, threshold functions, connectivity, Hamilton cycle, perfect ...

Background and Objective: The cell division cycle 25 (CDC25)is a familyof highly conserved dual-specificity phosphatases that activate cyclin-dependent kinase complexes. These complexes are the main cell cycle regulators. Mammalian cells ,exposure to DNA damaging radiations such as ionizing radiation and ultraviolet light, prevent cell cycle progression by activation of checkpoint pathways an...

The alternating integrable spin chain and the RSOS(q1, q2; p) model in the presence of a quantum impurity are investigated. The boundary free energy due to the impurity is derived, the ratios of the corresponding g functions at low and high temperature are specified and their relevance to boundary flows in unitary minimal and generalized coset models is discussed. Finally, the alternating spin ...

SUMMARY Alternate patterns of premature ventricular excitation have been observed during induced atrial bigeminy in 18 subjects, including five normal volunteers. Each study was performed in the cardiac catheterization suite where a transvenous catheter electrode was positioned in the right atrium. Coupled or paired stimuli were delivered to the atrium by an isolated battery-powered source at a...

We present a matching and LP based heuristic algorithm that decides graph non-Hamiltonicity. Each of the n! Hamilton cycles in a complete directed graph on n + 1 vertices corresponds with each of the n! n-permutation matrices P, such that pu,i = 1 if and only if the ith arc in a cycle enters vertex u, starting and ending at vertex n + 1. A graph instance (G) is initially coded as exclusion set ...

Hovey introduced $A$-cordial labelings as a generalization of cordial and harmonious \cite{Hovey}. If $A$ is an Abelian group, then labeling $f \colon V (G) \rightarrow A$ the vertices some graph $G$ induces edge on $G$, $uv$ receives label (u) + f (v)$. A if there vertex-labeling such that (1) vertex classes differ in size by at most one (2) induced one. The problem graphs can be naturally ext...

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs Jinquan Xu, Ping Li, Zhengke Miao, Keke Wang & Hong-Jian Lai a Department of Mathematics, HuiZhou University, HuiZhou, Guangdong 561007, China b Department of Mathematics, Beijing Jiaotong University, Beijing, China c School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou, Jiangsu, 2211...

A graph G is induced matching extendable (shortly, IM-extendable), if every induced matching of G is included in a perfect matching of G. A graph G is claw-free, if G does not contain any induced subgraph isomorphic toK1,3. The kth power of a graphG, denoted byGk , is the graph with vertex set V (G) in which two vertices are adjacent if and only if the distance between them in G is at most k. I...

In this paper, we study graphs with integer matching polynomial roots. We characterize all traceable graphs whose all matching polynomial roots are integer. We show that there is no k-regular claw-free graph (k ≥ 2), whose all matching polynomial roots are integer. Also we conjecture that apart from K7 \ (E(C3) ∪E(C4)), there is no matching integral k-regular graph (k ≥ 2). 2010 Mathematics Sub...