• Bulletin of the Korean Mathematical Society
• /
• v.30 no.1
• /
• pp.91-97
• /
• 1993

In this article, we consider the case that S is a topologically complete subspace of $R^{k}$ , and that .GAMMA. is a set of monotone functions on S into S. It is obtained the sugficient condition for the existence of a unique invariant probability to which $P^{(n}$/(x,dy) converges exponentially fast in a metric stronger than the Kolmogorov's distance. This extends the earlier results of Bhattacharya and Lee (1988) who considered the case .GAMMA. a set of nondecreasing functions.tions.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.845-854
• /
• 2007

In this paper we investigate relationships between closure-type and convergence-type properties of hyperspaces over a space X and covering properties of X.

• Honam Mathematical Journal
• /
• v.41 no.3
• /
• pp.595-607
• /
• 2019

We consider quasigroups $Q({\Gamma})$ obtained as certain double covers of the symmetric group $S_3$ of degree 3, for directed graphs ${\Gamma}$ on the vertex set $S_3$. We completely characterize the strong compatibility of elements of $Q({\Gamma})$ for any quasigroup nonuniform homogeneous space of degree 4. For such homogeneous spaces, we classify all the strong and weak compatibility graphs of $Q({\Gamma})$.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1647-1659
• /
• 2008

Let R be a ring with identity, X the set of all nonzero, nonunits of R and G the group of all units of R. First, we investigate some connected conditions of the zero-divisor graph $\Gamma(R)$ of a noncommutative ring R as follows: (1) if $\Gamma(R)$ has no sources and no sinks, then $\Gamma(R)$ is connected and diameter of $\Gamma(R)$, denoted by diam($\Gamma(R)$) (resp. girth of $\Gamma(R)$, denoted by g($\Gamma(R)$)) is equal to or less than 3; (2) if X is a union of finite number of orbits under the left (resp. right) regular action on X by G, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3, in addition, if R is local, then there is a vertex of $\Gamma(R)$ which is adjacent to every other vertices in $\Gamma(R)$; (3) if R is unit-regular, then $\Gamma(R)$ is connected and diam($\Gamma(R)$) (resp. g($\Gamma(R)$)) is equal to or less than 3. Next, we investigate the graph automorphisms group of $\Gamma(Mat_2(\mathbb{Z}_p))$ where $Mat_2(\mathbb{Z}_p)$ is the ring of 2 by 2 matrices over the galois field $\mathbb{Z}_p$ (p is any prime).

• Journal of IKEEE
• /
• v.9 no.2 s.17
• /
• pp.143-151
• /
• 2005

Finite failure NHPP models proposed in the literature exhibit is either constant, monotonic increasing or monotonic decreasing failure occurrence rates per fault. For the sake of proposing shape parameter of the Gamma family distribution, used the special pattern. Data set, where the underlying failure process could not be adequately described by the knowing models, which motivated the development of the Gamma or Weibull model and Gompertz model. Analysis of failure data set that led us to the Gamma or Weibull model and Gompertz model using arithmetic and Laplace trend tests, bias tests was presented in this Paper.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1085-1100
• /
• 2008

A set D of vertices of a graph G = (V(G),E(G)) is called a dominating set if every vertex of V(G) - D is adjacent to at least one element of D. The domination number of G, denoted by ${\gamma}(G)$, is the size of its smallest dominating set. Haynes et al.[5] present a conjecture: For any graph G with ${\delta}(G){\geq}k$,$\gamma(G){\leq}\frac{k}{3k-1}n$. When $k\;{\neq}\;6$, the conjecture was proved in [7], [8], [10], [12] and [13] respectively. In this paper we prove that every graph G on n vertices with ${\delta}(G)\;{\geq}\;6$ has a dominating set of order at most $\frac{6}{17}n$. Thus the conjecture was completely proved.

• Communications of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.361-369
• /
• 2018

For a given graph G = (V, E), a set $D{\subseteq}V(G)$ is said to be an outer-connected vertex edge dominating set if D is a vertex edge dominating set and the graph $G{\backslash}D$ is connected. The outer-connected vertex edge domination number of a graph G, denoted by ${\gamma}^{oc}_{ve}(G)$, is the cardinality of a minimum outer connected vertex edge dominating set of G. We characterize trees T of order n with l leaves, s support vertices, for which ${\gamma}^{oc}_{ve}(T)=(n-l+s+1)/3$ and also characterize trees with equal domination number and outer-connected vertex edge domination number.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.437-448
• /
• 2007

Suppose K is a nonempty closed convex nonexpansive retract of a real uniformly convex Banach space E with P as a nonexpansive retraction. Let $T_1,\;T_2\;and\;T_3\;:\;K{\rightarrow}E$ be nonexpansive mappings with nonempty common fixed points set. Let $\{\alpha_n\},\;\{\beta_n\},\;\{\gamma_n\},\;\{\alpha'_n\},\;\{\beta'_n\},\;\{\gamma'_n\},\;\{\alpha'_n\},\;\{\beta'_n\}\;and\;\{\gamma'_n\}$ be real sequences in [0, 1] such that ${\alpha}_n+{\beta}_n+{\gamma}_n={\alpha}'_n+{\beta'_n+\gamma}'_n={\alpha}'_n+{\beta}'_n+{\gamma}'_n=1$, starting from arbitrary $x_1{\in}K$, define the sequence $\{x_n\}$ by $$\{zn=P({\alpha}'_nT_1x_n+{\beta}'_nx_n+{\gamma}'_nw_n)\;yn=P({\alpha}'_nT_2z_n+{\beta}'_nx_n+{\gamma}'_nv_n)\;x_{n+1}=P({\alpha}_nT_3y_n+{\beta}_nx_n+{\gamma}_nu_n)$$ with the restrictions $\sum^\infty_{n=1}{\gamma}_n<\infty,\;\sum^\infty_{n=1}{\gamma}'_n<\infty,\; \sum^\infty_{n=1}{\gamma}'_n<\infty$. (i) If the dual $E^*$ of E has the Kadec-Klee property, then weak convergence of a $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is proved; (ii) If $T_1,\;T_2\;and\;T_3$ satisfy condition(A'), then strong convergence of $\{x_n\}$ to some $x^*{\in}F(T_1){\cap}{F}(T_2){\cap}(T_3)$ is obtained.

• Kyungpook Mathematical Journal
• /
• v.56 no.4
• /
• pp.1103-1113
• /
• 2016

In this paper, we study a directed simple graph ${\Gamma}_S(N)$ for a near-ring N, where the set $V^*(N)$ of vertices is the set of all left N-subsets of N with nonzero left annihilators and for any two distinct vertices $I,J{\in}V^*(N)$, I is adjacent to J if and only if IJ = 0. Here, we deal with the diameter, girth and coloring of the graph ${\Gamma}_S(N)$. Moreover, we prove a sufficient condition for occurrence of a regular element of the near-ring N in the left annihilator of some vertex in the strong zero-divisor graph ${\Gamma}_S(N)$.

• Communications for Statistical Applications and Methods
• /
• v.24 no.2
• /
• pp.129-142
• /
• 2017

In this paper we consider the problem of the model selection/discrimination among three different positively skewed lifetime distributions. Lindley, Weibull, and gamma distributions have been used to effectively analyze positively skewed lifetime data. This paper assesses how much closer the Lindley distribution gets to Weibull and gamma distributions. We consider three techniques that involve the likelihood ratio test, asymptotic likelihood ratio test, and minimum Kolmogorov distance as optimality criteria to diagnose the appropriate fitting model among the three distributions for a given data set. Monte Carlo simulation study is performed for computing the probability of correct selection based on the considered optimality criteria among these families of distributions for various choices of sample sizes and shape parameters. It is observed that overall, the Lindley distribution is closer to Weibull distribution in the sense of likelihood ratio and Kolmogorov criteria. A real data set is presented and analyzed for illustrative purposes.