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

Let ${\alpha}$ be a positive integer, and let $p_1$, $p_2$ be two distinct prime numbers with $p_1$ < $p_2$. By using elementary methods, we give two equivalent conditions of all even near-perfect numbers in the form $2^{\alpha}p_1p_2$ and $2^{\alpha}p_1^2p_2$, and obtain a lot of new near-perfect numbers which involve some special kinds of prime number pairs. One kind is exactly the new Mersenne conjecture's prime number pair. Another kind has the form $p_1=2^{{\alpha}+1}-1$ and $p_2={\frac{p^2_1+p_1+1}{3}}$, where the former is a Mersenne prime and the latter's behavior is very much like a Fermat number.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.829-836
• /
• 2021

In this paper, we consider several domination parameters like perfect domination number, locating-domination number, open-locatingdomination number, etc. in the Mycielski graph M(G) of a graph G. We found upper bounds for locating-domination number of M(G) and computational formulae for perfect locating-domination number and open locating-domination number of M(G). We also showed that the perfect domination number of M(G) is at least that of G plus 1 and that for each positive integer n, there exists a graph G_n such that the perfect domination number of M(G_n) is equal to that of G_n plus n.

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

The thrust of this paper is to extend the notion of Plithogenic vertex domination to the basic operations in Plithogenic product fuzzy graphs (PPFGs). When the graph is a complete PPFG, Plithogenic vertex domination numbers (PVDNs) of its Plithogenic complement and perfect Plithogenic complement are the same, since the connectivities are the same in both the graphs. Since extra edges are added to the graph in the case of perfect Plithogenic complement, the PVDN of perfect Plithogenic complement is always less than or equal to that of Plithogenic complement, when the graph under consideration is an incomplete PPFG. The maximum and minimum values of the PVDN of the intersection or the union of PPFGs depend upon the attribute values given to P-vertices, the number of attribute values and the connectivities in the corresponding PPFGs. The novelty in this study is the investigation of the variations and the relations between PVDNs in the operations of Plithogenic complement, perfect Plithogenic complement, union and intersection of PPFGs.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.339-344
• /
• 2007

The relationships between binding number and fractional edge (vertex)-deletability or fractional k-extendability of graphs are studied. Furthermore, we show that the result about fractional vertex-deletability are best possible.

• Journal of the Korean Statistical Society
• /
• v.28 no.3
• /
• pp.389-398
• /
• 1999

We consider an imperfect repair model under which either a perfect repair or a minimal repair can be performed at each failure of a unit. Some stochastic properties of the number of perfect repairs and the number of minimal repairs under the imperfect repair model are investigated. We also derive the expressions for evaluating the expected numbers of perfect and minimal repairs in general and apply these formulas for certain parametric families of life distributions.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1956-1959
• /
• 2002

Power control (PC) on the reverse link of CDMA cellular system is important to increase system capacity. PC eliminates fluctuations in the received signal level and hence reduces the required signal-to-interference ratio. However, both perfect PC and imperfect PC depend on number of interferences as number of users, which by using smart antenna system can decrease number of interferences in any directions except interferences from the main beam direction. In this paper , number of elements in smart antenna system, which directly relates to the main beam pattern, is studied to find the effects on the outage probability , bit energy-to-interference density ratio (Eb/Io) and the capacities of both perfect and imperfect PC.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.4 no.2
• /
• pp.202-214
• /
• 2001

In this paper the upwind flux difference splitting Navier-Stokes method has been applied to study quasi one-dimensional nozzle flow and axisymmetric sphere-cone($5^{\circ}$) flow for the perfect gas, the equilibrium and the nonequilibrium chemically reacting hypersonic flow. The effective gamma(${ \tilde{\gamma}}$), enthalpy to internal energy ratio was used to couple chemistry with the fluid mechanics for equilibrium chemically reacting air. The influences of the various altitude(30km, 50km) at Mach number(15.0, 20.0) were investigated. The equilibrium shock position was located farthest downstream when compared with those of perfect gas in a quasi one-dimensional nozzle. The equilibrium shock thickness over the blunt body region was much thinner than that of perfect gas shock.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.65-75
• /
• 2007

A graph G is self-complementary (sc) if it is isomorphic to its complement. G is perfect if for all induced subgraphs H of G, the chromatic number of H (denoted ${\chi}$(H)) equals the number of vertices in the largest clique in H (denoted ${\omega}$(H)). An sc graph which is also perfect is known as sc perfect graph. A comparability graph is an undirected graph if it can be oriented into transitive directed graph. An sc comparability (scc) is clearly a subclass of sc perfect graph. In this paper we show that no two non-isomorphic scc graphs with n vertices each, (n<13) have same spectrum, and that the smallest positive integer for which there exists hyper-energetic scc graph is 13.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.661-669
• /
• 2021

For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑_v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γ_R^P(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.

• International Journal of Reliability and Applications
• /
• v.4 no.1
• /
• pp.27-40
• /
• 2003

Maintenance models involving minimal imperfect repair frequently appear in the literature of reliability and operations research. Most of the literatures concerning the stochastic behavior of repairable systems assume that it takes negligible time to repair a failed system and so the length of repair time does not affect the maintenance strategy. It is more realistic to consider the length of repair times in developing maintenance model, however. In this paper, we consider an imperfect repair model with random repair time and investigate some stochastic properties of the number of perfect repairs and the number of minimal repairs. Also we derive the expressions for evaluating the expected numbers of perfect and minimal repairs in general and apply these formulas for certain parametric life distributions.