• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.511-520
• /
• 2024

In this paper, we introduce the concept of split and non-split tree (D, C)- set of a connected graph G and its associated color variable, namely split tree (D, C) number and non-split tree (D, C) number of G. A subset S ⊆ V of vertices in G is said to be a split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is disconnected. The minimum size of the split tree (D, C) set of G is the split tree (D, C) number of G, γ_χST (G) = min{|S| : S is a split tree (D, C) set}. A subset S ⊆ V of vertices of G is said to be a non-split tree (D, C) set of G if S is a tree (D, C) set and ⟨V - S⟩ is connected and non-split tree (D, C) number of G is γ_χST (G) = min{|S| : S is a non-split tree (D, C) set of G}. The split and non-split tree (D, C) number of some standard graphs and its compliments are identified.

• Korean Journal of Mathematics
• /
• v.21 no.4
• /
• pp.455-462
• /
• 2013

Let D be an integral domain, S be a saturated multi-plicative subset of D such that $D_S$ is a factorial domain, $\{X_{\alpha}\}$ be a nonempty set of indeterminates, and $D[\{X_{\alpha}\}]$ be the polynomial ring over D. We show that S is a splitting (resp., almost splitting, t-splitting) set in D if and only if every nonzero prime t-ideal of D disjoint from S is principal (resp., contains a primary element, is t-invertible). We use this result to show that $D{\backslash}\{0\}$ is a splitting (resp., almost splitting, t-splitting) set in $D[\{X_{\alpha}\}]$ if and only if D is a GCD-domain (resp., UMT-domain with $Cl(D[\{X_{\alpha}\}]$ torsion UMT-domain).

• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.503-517
• /
• 2016

For positive integers d and n, let $[n]^d$ be the set of all vectors ($a_1,a_2,{\cdots},a_d$), where ai is an integer with $0{\leq}a_i{\leq}n-1$. A subset S of $[n]^d$ is called a Sidon set if all sums of two (not necessarily distinct) vectors in S are distinct. In this paper, we estimate two numbers related to the maximum size of Sidon sets in $[n]^d$. First, let $\mathcal{Z}_{n,d}$ be the number of all Sidon sets in $[n]^d$. We show that ${\log}(\mathcal{Z}_{n,d})={\Theta}(n^{d/2})$, where the constants of ${\Theta}$ depend only on d. Next, we estimate the maximum size of Sidon sets contained in a random set $[n]^d_p$, where $[n]^d_p$ denotes a random set obtained from $[n]^d$ by choosing each element independently with probability p.

• Review of KIISC
• /
• v.15 no.4
• /
• pp.17-28
• /
• 2005

SET는 인터넷과 같은 개방형 통신망에서 안전하고 효율적인 신용카드 기반의 전자결제를 수행하기 위해 개발된 전자지불 프로토콜이다. 하지만 SET를 이용한 신용카드 기반 전자지불시스템은 사용상의 불편함과 구현의 복잡성, 서버에 대한 과중한 부하 등의 이유로 상업화에는 실패하여 SSL/TLS 프로토콜 방식이 주로 사용되고 있다. 최근에는 SSL/TLS와 SET의 장점을 모두 만족시키는 새로운 모델인 3D SET와 3-D Secure가 제시되었다. 본 고에서는 전반적인 SET 프로토콜의 개요와 SET에 사용된 보안 기술에 대해서 살펴보고, SSL/TLS 프로토콜과의 장$\cdot$단점을 비교/분석한다. 그리고, SET 이후에 등장한 3D SET와 3-D Secure에 대한 동향을 분석하고, 모바일 전자상거래를 위한 Wireless SET에 대해 살펴보기로 한다.

• International Journal of Precision Engineering and Manufacturing
• /
• v.6 no.4
• /
• pp.31-36
• /
• 2005

This paper describes a research work on the die design for the deep drawing & ironing(D. D. I) of high pressure gas cylinder. D. D. I die set is large-sized die used in horizontal press, which is usually composed of a drawing, and an ironing die. Design method of D. D. I die set is very different from that of conventional cold forging die set. Outer diameter of the die set is fixed because of press specification and that of the insert should be as small as possible for saving material cost. In this study, D. D. I die set has been designed to consider those characteristics, and the feasibility of the designed die has been verified by FE-analysis. In addition, the automated system of die design has been developed in AutoCAD R14 by formulating the applied methods to the regular rules.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.1013-1018
• /
• 2009

Let * be an e.a.b. star operation on an integrally closed domain D, and let $K\gamma$(D, *) be the Kronecker function ring of D. We show that if D is a P*MD, then the mapping $D_{\alpha}{\mapsto}K{\gamma}(D_{\alpha},\;{\upsilon})$ is a bijection from the set {$D_{\alpha}$} of *-linked overrings of D into the set of overrings of $K{\gamma}(D,\;{\upsilon})$. This is a generalization of [5, Proposition 32.19] that if D is a Pr$\ddot{u}$fer domain, then the mapping $D_{\alpha}{\mapsto}K_{\gamma}(D_{\alpha},\;b)$ is a one-to-one mapping from the set {$D_{\alpha}$} of overrings of D onto the set of overrings of $K_{\gamma}$(D, b).

• Elastomers and Composites
• /
• v.53 no.4
• /
• pp.220-225
• /
• 2018

Resilient pads play a major role in reducing the impact of loads on a rail in a rail-fastening system, which is essentially used for a concrete track. Although a compression set test is commonly used to measure the durability of a resilient pad, the static spring constant is often observed to be different from the fatigue test. In this study, a modified compression set test method was proposed to monitor the variations in the compression set and static spring constant of a resilient pad with respect to temperature and time. In addition, the life of the resilient pad was predicted by performing an acceleration test based on the Arrhenius equation.

• Kyungpook Mathematical Journal
• /
• v.56 no.1
• /
• pp.69-81
• /
• 2016

For a positive integer k, a k-rainbow dominating function of a digraph D is a function f from the vertex set V (D) to the set of all subsets of the set $\{1,2,{\ldots},k\}$ such that for any vertex $v{\in}V(D)$ with $f(v)={\emptyset}$ the condition ${\cup}_{u{\in}N^-(v)}$ $f(u)=\{1,2,{\ldots},k\}$ is fulfilled, where $N^-(v)$ is the set of in-neighbors of v. A set $\{f_1,f_2,{\ldots},f_d\}$ of k-rainbow dominating functions on D with the property that $\sum_{i=1}^{d}{\mid}f_i(v){\mid}{\leq}k$ for each $v{\in}V(D)$, is called a k-rainbow dominating family (of functions) on D. The maximum number of functions in a k-rainbow dominating family on D is the k-rainbow domatic number of D, denoted by $d_{rk}(D)$. In this paper we initiate the study of the k-rainbow domatic number in digraphs, and we present some bounds for $d_{rk}(D)$.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.3
• /
• pp.227-234
• /
• 2022

Let 𝔽_q be a finite field with odd q elements. In this article, we prove that if E ⊆ 𝔽^d_q, d ≥ 2, and |E| ≥ q, then there exists a set Y ⊆ 𝔽^d_q with |Y| ~ q^d such that for all y ∈ Y, the number of distances between the point y and the set E is ~ q. As a corollary, we obtain that for each set E ⊆ 𝔽^d_q with |E| ≥ q, there exists a set Y ⊆ 𝔽^d_q with |Y| ~ q^d so that any set E ∪ {y} with y ∈ Y determines a positive proportion of all possible distances. The averaging argument and the pigeonhole principle play a crucial role in proving our results.

• Journal of applied mathematics & informatics
• /
• v.39 no.1_2
• /
• pp.155-163
• /
• 2021

For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.