• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.3
• /
• pp.55-73
• /
• 2022

This study aims to identify the object relations and PAD factors of Instagram users, apply the object relations to the emotional response (PAD) factors, and empirically study the structural relationship between these factors and satisfaction. To this end, we proposed a research model to which the four factors of object relations theory and the three factors of emotional response (PAD) theory that emphasize the emotions of users are applied. Surveys were conducted on the college students in Seoul and Suwon who had used Instagram. As a result of this study, the following conclusions can be drawn: Non-alienation has a significant influence on pleasure, arousal, and domination. Secure attachment does not have a significant influence on pleasure and arousal, while it does have on domination. Social ability does not have a significant influence on pleasure, arousal, and domination. Egocentrism has a significant influence on arousal, but not on pleasure and domination. Pleasure has a significant influence on arousal and satisfaction. Arousal has a significant influence on domination and satisfaction. Domination has a significant influence on satisfaction. In conclusion, when emotions are shared among the users of Instagram, not alienated, it affects their satisfaction.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.8
• /
• pp.1114-1122
• /
• 2018

In this paper, we propose a theoretical framework for provisioning marginal resources in wired and wireless computer networks which include Internet. In more detail, we propose a mathematical model for the upper bounds of marginal capacity in grid networks, where the resource is designed a priori by normal traffic estimation and marginal resource is prepared for unexpected events such as natural disasters and abrupt flash crowd in public affairs. To be specific, we propose a method to evaluate an upper bound for minimum marginal capacity for an arbitrary grid topology using the concept of a strong Roman domination number. To that purpose, we introduce a graph theory to model and analyze the characteristics of general grid structure networks. After that we propose a new tight upper bound for the strong Roman domination number. Via a numerical example, we show the validity of the proposition.

• 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.

• Journal of the Korean Statistical Society
• /
• v.24 no.2
• /
• pp.361-373
• /
• 1995

Three remarks are offered, pertaining to classes of estimators Pitman-dominating a given estimator. The first remark concerns incorporating general loss in the construction of such classes. The second remark concerns Pitman domination comparisons amongst the members of such classes. The third remark concerns construction of such a class in the location-scale case.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.103-106
• /
• 2000

In this paper, we introduce a new evolutionary multiobjective optimization algorithm based on the non-domination direction information, which can be an alternative among several multiobjective evolutionary algorithms. The new evolutionary multiobjective optimization algorithm proposed in this paper will not use the conventional recombination or mutation operators but use the non-domination directions, which are extracted from the non-domination relation among the population. And the problems of the modified sharing algorithms are pointed out and a new sharing algorithm sill be proposed to overcome those problems.

• Korean Journal of Human Ecology
• /
• v.17 no.3
• /
• pp.493-500
• /
• 2008

The purposes of this study were to investigate the factors of affect induced by fashion advertising and to analyze the effects of affect on advertising effects: advertising preference, brand preference, and purchase intention. A total of 400 college students were surveyed in September, 2006, using 4 TV fashion advertisements(Bean pole, Bang bang, Nike, and Adidas). The data were analyzed with factor analysis, multiple regression analysis, ANOVA, Scheffe Test, Cronbach's $\alpha$, and path analysis, using the SPSS 12.0. The results were as follows; 1) Two factors of affect were identified: 'pleasure' and 'domination and arousal'; 2) There were differences of induced affect factors, advertising preference, brand preference, and purchase intention among 4 TV fashion advertisements; 3) Advertising preference was more affected by 'pleasure' than by 'domination and arousal'; 4) Brand preference was affected by advertising preference, 'domination and arousal' and 'pleasure' in order of significance; and 5) Purchase intention was affected by brand preference, 'domination and arousal', advertising preference, and 'pleasure' in order of significance.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2021-2026
• /
• 2013

Let G = (V,E) be a graph. A function $f:V{\rightarrow}\{-1,+1\}$ defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, ${\gamma}^s_t(G)$, is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen graphs P(n, 2) and prove that for any integer $n{\geq}6$, ${\gamma}^s_t(P(n,2))=2[\frac{n}{3}]+2t$, where $t{\equiv}n(mod\;3)$ and $0 {\leq}t{\leq}2$.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.39-48
• /
• 2006

Let ${\gamma}$(G) be the domination number of a graph G. It is shown that for any $k {\ge} 0$ there exists a Cartesian graph bundle $B{\Box}_{\varphi}F$ such that ${\gamma}(B{\Box}_{\varphi}F) ={\gamma}(B){\gamma}(F)-2k$. The domination numbers of Cartesian bundles of two cycles are determined exactly when the fibre graph is a triangle or a square. A statement similar to Vizing's conjecture on strong graph bundles is shown not to be true by proving the inequality ${\gamma}(B{\bigotimes}_{\varphi}F){\le}{\gamma}(B){\gamma}(F)$ for strong graph bundles. Examples of graphs Band F with ${\gamma}(B{\bigotimes}_{\varphi}F) < {\gamma}(B){\gamma}(F)$ are given.

• 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.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.391-402
• /
• 2022

For a given graph G = (V, E), a dominating set is a subset V' of the vertex set V so that each vertex in V ＼ V' is adjacent to a vertex in V'. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by γ(G). For an integer k ≥ 1, the k-th power G^k of a graph G with V (G^k) = V (G) for which uv ∈ E(G^k) if and only if 1 ≤ d_G(u, v) ≤ k. Note that G² is the square graph of a graph G. In this paper, we obtain some tight bounds for the sum of the domination numbers of a graph and its square graph in terms of the order, order and size, and maximum degree of the graph G. Also, we characterize such extremal graphs.