• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.60-65
• /
• 2008

The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.293-297
• /
• 2006

Using the concept of codes on ordered sets introduced by Brualdi, Graves and Lawrence, we consider perfect codes on the ordinal sum of two ordered sets, the standard ordered sets and the disjoint sum of two chains.

• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.15-29
• /
• 2024

Many academics employ various structures to expand topological space, including the idea of topology, as a result of the importance of topological space in analysis and some applications. One of the most notable of the generalizations was the definition of perfect functions in bitopological spaces, which was presented by Ali.A.Atoom and H.Z.Hdeib. We propose the notion of α- pairwise perfect functions in bitopological spaces and define different types of this concept in this study. Pairwise -T - α- perfect functions, pairwise -α-irr-perfect functions, and pairwise -T - α- irr-perfect functions, are all characterized in addition to pairwise -α-perfect functions. We go through their primary characteristics and show how they interact. Finally, under these functions, we introduce the images and inverse images of certain bitopological features. About these concepts, some product theorems have been discovered.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.839-848
• /
• 2023

Let G be a simple undirected graph. A planar graph known as a Halin graph(HG) is characterised by having three connected and pendent vertices of a tree that are connected by an outer cycle. A subset S of V is said to be a dominating set of the graph G if each vertex u that is part of V is dominated by at least one element v that is a part of S. The domination number of a graph is denoted by the γ(G), and it corresponds to the minimum size of a dominating set. A dominating set S is called a secure dominating set if for each v ∈ V＼S there exists u ∈ S such that v is adjacent to u and S₁ = (S＼{v}) ∪ {u} is a dominating set. The minimum cardinality of a secure dominating set of G is equal to the secure domination number γ_s(G). In this article we found the secure domination number of Halin graph(HG) with perfet k-ary tree and also we determined secure domination of rooted product of special trees.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.221-224
• /
• 2001

A new code: LS code was proposed for IMT-2000 CDMA system. The code has special properties during a certain time of interval: 1) perfect autocorrelation 2) perfect crosscorrelation. The perfect autocorrelation means that the autocorrelation has nMaximum for zero time-offset and zero for other times during a certain time. Moreover the perfect crosscorrelation means that the crosscorrelation has zero during a time of interest. In the LAS-DMA system, the LS code is only used in the spreading of data bits in contrast to the conventional CDMA system. Therefore the LS code pair setting and allocation order should be dealt with carefully considering the special properties of LS code. This paper is intended as an investigation of the setting LS code pair and the sequential allocation method. Firstly, the optimum LS code pair set is proposed in order to minimize PAPR. Secondly, the sequential allocation method is studied to either minimize PAPR or expand IFW.

• Environmental and Resource Economics Review
• /
• v.12 no.3
• /
• pp.427-452
• /
• 2003

Demand analyses often assume perfect substitution and some level of aggregation before analysis and data collection. Earlier works on this subject are carried out in the context of ordinary demand systems. However, perfect substitution is a degenerate special case in the systems and it is much more easily handled in a system of marginal value functions and no previous analysis has used the marginal value functions to test for perfect substitution and make possible aggregation with prior restrictions. In this article, we present the empirical results on a system of marginal value functions in fisheries and pose testable results of perfect substitution and aggregation. The contribution of this article is new establishment of a set of restrictions implying perfect substitutability among all commodities and the application to the problem of commodity aggregate. A system of marginal value functions is estimated in fisheries and its implication of perfect substitution is reasonably drawn.

• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.685-697
• /
• 2015

For a field K, a square-free monomial ideal I of K[$x_1$, . . ., $x_n$] is called an f-ideal, if both its facet complex and Stanley-Reisner complex have the same f-vector. Furthermore, for an f-ideal I, if all monomials in the minimal generating set G(I) have the same degree d, then I is called an $(n, d)^{th}$ f-ideal. In this paper, we prove the existence of $(n, d)^{th}$ f-ideal for $d{\geq}2$ and $n{\geq}d+2$, and we also give some algorithms to construct $(n, d)^{th}$ f-ideals.

• Journal of the Korean Statistical Society
• /
• v.30 no.4
• /
• pp.667-678
• /
• 2001

The asymptotic behavior and distribution for quantiles estimators using ranked samples are introduced. Applications of quantiles estimation on finding the normal ranges (2.5% and 97.5% percentiles) and the median of some medical characteristics and on finding the Hodges-Lehmann estimate are discussed. The conclusion of this study is, whenever perfect ranking is possible, the relative efficiency of quantiles estimation using ranked samples relative to SRS is high. This may translates to large savings in cost and time. Also, this conclusion holds even if the ranking is not perfect. Computer simulation results are given and real data from lows 65+ study is used to illustrate the method.

• Speech Sciences
• /
• v.12 no.2
• /
• pp.153-170
• /
• 2005

The sub-Nyquist nonuniform sampling (SNNS) and the perfect reconstruction (PR) formula are proposed for the development of a systematic method to obtain minimal representation of a speech signal. In the proposed method, the instantaneous sampling frequency (ISF) varies, depending on the least upper boundary of spectral support of a speech signal in time-frequency domain (TFD). The definition of the instantaneous bandwidth (IB), which determines the ISF and is used for generating the set of samples that represent continuous-time signals perfectly, is given. Also, the spectral characteristics of the sampled data generated by the sub-Nyquist nonuniform sampling method is analyzed. The proposed method doesn't generate the redundant samples due to the time-varying property of the instantaneous bandwidth of a speech signal.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.16 no.5
• /
• pp.1-6
• /
• 2017

Gear tooth micro-geometry modifications include the intentional removal of material from the gear teeth flanks, so that the shape is no longer a perfect involute. If the gear shapes are perfect, then the gear tooth meshing is better, therefore the gears will transmit input torque in a more efficient manner without the generation of high frequency engine fluctuation noise. In this paper, we study tooth micro-geometry optimization of rear gear set in 2 speed planetary gear reducers. Analysis revealed problems which are need of modification. Based on the results, tooth micro-geometry was used to deal with load distributions on the rear gear set.