• The Journal of Advanced Prosthodontics
• /
• v.13 no.5
• /
• pp.269-280
• /
• 2021

PURPOSE. The objective of this study was to evaluate the effect of thickness reduction and fatigue on the failure load of monolithic zirconia crowns. MATERIALS AND METHODS. 140 CAD-CAM fabricated crowns (3Y-TZP, inCorisTZI, Dentsply-Sirona) with different ceramic thicknesses (2.0, 1.5, 1.0, 0.8, 0.5 mm, respectively, named G2, G1.5, G1, G0.8, and G0.5) were investigated. Dies of a mandibular first molar were made of composite resin. The zirconia crowns were luted with a resin composite cement (RelyX Unicem 2 Automix, 3M ESPE). Half of the specimens (n = 14 per group) were mouth-motion-fatigued (1.2 million cycles, 1.6 Hz, 200 N/ 5 - 55℃, groups named G2-F, G1.5-F, G1-F, G0.8-F, and G0.5-F). Single-load to failure was performed using a universal testing-machine. Fracture modes were analyzed. Data were statistically analyzed using a Weibull 2-parameter distribution (90% CI) to determine the characteristic strength and Weibull modulus differences among the groups. RESULTS. Three crowns (21%) of G0.8 and five crowns (36%) of G0.5 showed cracks after fatigue. Characteristic strength was the highest for G2, followed by G1.5. Intermediate values were observed for G1 and G1-F, followed by significantly lower values for G0.8, G0.8-F, and G0.5, and the lowest for G0.5-F. Weibull modulus was the lowest for G0.8, intermediate for G0.8-F and G0.5, and significantly higher for the remaining groups. Fatigue only affected G0.5-F. CONCLUSION. Reduced crown thickness lead to reduced characteristic strength, even under failure loads that exceed physiological chewing forces. Fatigue significantly reduced the failure load of 0.5 mm monolithic 3Y-TZP crowns.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.909-912
• /
• 2010

In this note we present a short proof of the following result by Zhou, Liu and Xu. Let G be a graph of order n, and let a and b be two integers with 1 $\leq$ a < b and b $\geq$ 3, and let g and f be two integer-valued functions defined on V(G) such that a $\leq$ g(x) < f(x) $\leq$ b for each $x\;{\in}\;V(G)$ and f(V(G)) - V(G) even. If $n\;{\geq}\;\frac{(a+b-1)^2+1}{a}$ and $\delta(G)\;{\geq}\;\frac{(b-1)n}{a+b-1}$,then G has a connected (g, f)-factor.

• Journal of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.105-115
• /
• 2011

Let f be a function which assigns a positive integer f(v) to each vertex v $\in$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\in$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by ${\chi}'_f$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\bigcup$ E(G) to the color set C = {0, 1, $\ldots$; k - 1} such that |c($v_i$) - c($v_j$ )| $\geq$ r for every two adjacent vertices $v_i$ and $v_j$, |c($e_i$ - c($e_j$)| $\geq$ s and ${\alpha}(v_i)$ $\leq$ f($v_i$) for all $v_i$ $\in$ V (G), ${\alpha}$ $\in$ C where ${\alpha}(v_i)$ denotes the number of ${\alpha}$-edges incident with the vertex $v_i$ and $e_i$, $e_j$ are edges which are incident with $v_i$ but colored with different colors, |c($e_i$)-c($v_j$)| $\geq$ t for all pairs of incident vertices and edges. The minimum k such that G has an [r, s, t; f]-coloring with k colors is defined as the [r, s, t; f]-chromatic number and denoted by ${\chi}_{r,s,t;f}$ (G). In this paper, we present some general bounds for [r, s, t; f]-coloring firstly. After that, we obtain some important properties under the restriction min{r, s, t} = 0 or min{r, s, t} = 1. Finally, we present some problems for further research.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2124-2132
• /
• 1999

Given a graph G=(V,E), Ld(2,1)-labeling of G is a function f : V(G)$\longrightarrow$[0,$\infty$) such that, if v1,v2$\in$V are adjacent, $\mid$ f(x)-f(y) $\mid$$\geq$2d, and, if the distance between and is two, $\mid$ f(x)-f(y) $\mid$$\geq$d, where dG(,v2) is shortest distance between v1 and in G. The L(2,1)-labeling number (G) is the smallest number m such that G has an L(2,1)-labeling f with maximum m of f(v) for v$\in$V. This problem has been studied by Griggs, Yeh and Sakai for the various classes of graphs. In this paper, we discuss the upper-bound of ${\lambda}$ (G) for a chordal graph G and that of ${\lambda}$(G') for a permutation graph G'.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1157-1163
• /
• 2009

Let G be a graph with vertex set V(G) and let f be a nonnegative integer-valued function defined on V(G). A spanning subgraph F of G is called a fractional f-factor if $d^h_G$(x)=f(x) for all x $\in$ for all x $\in$ V (G), where $d^h_G$ (x) = ${\Sigma}_{e{\in}E_x}$ h(e) is the fractional degree of x $\in$ V(F) with $E_x$ = {e : e = xy $\in$ E|G|}. In this paper it is proved that if ${\delta}(G){\geq}{\frac{b^2(k-1)}{a}},\;n>\frac{(a+b)(k(a+b)-2)}{a}$ and $|N_G(x_1){\cup}N_G(x_2){\cup}{\cdots}{\cup}N_G(x_k)|{\geq}\frac{bn}{a+b}$ for any independent subset ${x_1,x_2,...,x_k}$ of V(G), then G has a fractional f-factor. Where k $\geq$ 2 be a positive integer not larger than the independence number of G, a and b are integers such that 1 $\leq$ a $\leq$ f(x) $\leq$ b for every x $\in$ V(G). Furthermore, we show that the result is best possible in some sense.

• Communications of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.125-136
• /
• 2022

For k = 1, 2, let $f_k=h_k+{\bar{g_k}}$ be normalized harmonic right half-plane or vertical strip mappings. We consider the convex combination ${\hat{f}}={\eta}f_1+(1-{\eta})f_2={\eta}h_1+(1-{\eta})h_2+{\overline{\bar{\eta}g_1+(1-\bar{\eta})g_2}}$ and the combination ${\tilde{f}}={\eta}h_1+(1-{\eta})h_2+{\overline{{\eta}g_1+(1-{\eta})g_2}}$. For real 𝜂, the two mappings ${\hat{f}}$ and ${\tilde{f}}$ are the same. We investigate the univalence and directional convexity of ${\hat{f}}$ and ${\tilde{f}}$ for 𝜂 ∈ ℂ. Some sufficient conditions are found for convexity of the combination ${\tilde{f}}$.

• Communications of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.55-82
• /
• 2019

Given ${\sigma}:G{\rightarrow}G$ an involutive automorphism of a semigroup G, we study the solutions and stability of the following functional equations $$f(x{\sigma}(y))=f(x)g(y)+g(x)f(y),\;x,y{\in}G,\\f(x{\sigma}(y))=f(x)f(y)-g(x)g(y),\;x,y{\in}G$$ and $$f(x{\sigma}(y))=f(x)g(y)-g(x)f(y),\;x,y{\in}G$$, from the theory of trigonometric functional equations. (1) We determine the solutions when G is a semigroup generated by its squares. (2) We obtain the stability results for these equations, when G is an amenable group.

• The KIPS Transactions:PartB
• /
• v.15B no.2
• /
• pp.131-136
• /
• 2008

L(2,1)-labeling of a graph G is a function f: V(G) $\rightarrow$ {0, 1, 2, ...} such that $|f(u)\;-\;f(\upsilon)|\;{\geq}\;2$ when d(u, v) = 1 and $|f(u)\;-\;f(\upsilon)|\;{\geq}\;1$ when d(u, $\upsilon$) = 2. L(2,1)-labeling number of G, denoted by ${\lambda}(G)$, is the smallest number m such that G has an L(2,1)-labeling with no label greater than m. Since this problem has been proved to be NP-complete, in this article, we develop genetic algorithms for L(2,1)-labeling problem and show that the suggested genetic algorithm peforms very efficiently by applying the algorithms to the class of graphs with known optimum values.

• Research in Plant Disease
• /
• v.18 no.4
• /
• pp.310-316
• /
• 2012

Gibberellea fujikuroi species (Gf) complex comprises at least 15 species, most of which not only causes serious plant diseases, but also produces mycotoxins including fumonisins. Here, we focused on the abilities of the field isolates belonging to the Gf complex associated with rice and corn, respectively in Korea to produce fumonisin, all of which were confirmed to carry FUM1, the polyketide synthase gene essential for fumonisin biosynthesis. A total of 88 Gf complex isolates (55 F. fujikuroi, 10 F. verticillioides, 20 F. proliferatum, 2 F. subglutinans, and 1 F. concentricum), and 4 isolates of F. commune, which is a non-member of Gf complex, were grown on rice substrate and determined for their production levels of fumonisins by a HPLC method. Most isolates of F. verticillioides and F. proliferatum, regardless of host origins, produced fumonisin $B_1$ and $B_2$ at diverse ranges of levels ($0.5-2,686.4{\mu}g/g$, and $0.7-1,497.6{\mu}g/g$, respectively). In contrast, all the isolates of F. fujikuroi and other Fusarium species examined produced no fumonisins or only trace amounts ($<10{\mu}g/g$) of fumonisins. Interestingly, the frequencies of relatively high fumonisin-producers among the F. proliferatum and F. fujikuroi isolates derived from corn were higher than those among the fungal isolates from rice. In addition, it is a first report demonstrating the ability of the FUM1-carrying F. commune isolates from rice to produce fumonisins.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.345-351
• /
• 2022

For simple undirected graph G=(V,E), L(2,1)-coloring of G is a nonnegative real-valued function f : V → [0,1,…,k] such that whenever vertices x and y are adjacent in G then |f(x)-f(y)|≥ 2 and whenever the distance between x and y is 2, |f(x)-f(y)|≥ 1. For a given L(2,1)-coloring c of graph G, the c-span is λ(c) = max{|c(v)-c(v)||u,v∈V}. L(2,1)-coloring number λ(G) = min{λ(c)} where the minimum is taken over all L(2,1)-coloring c of graph G. In this paper, based on Harary's Theorem, we use Tabu Search to figure out the existence of Hamiltonian Path in a complementary graph and confirmed that if λ(G) is equal to n(=|V|).