• SUVANNABHUMI
• /
• v.15 no.2
• /
• pp.155-185
• /
• 2023

This paper aims to identify the shifts of masculine domination, illuminating Vietnamese men and women's actual position in society through surveying the mixed and hybrid characteristics described in the feminist texts in the early twentieth century. This paper concentrates on the feminist writings of the two exceptionally male intellectuals Nguyễn Văn Vĩnh (1882-1936) and Phan Khôi (1887-1959). in order to implement these goals, the paper first examines the popular phenomenon of ventriloquism among Vietnamese male intellectuals, whose dominant attitudes may still be unveiled in feminist texts. Secondly, the paper focuses on surveys of men's direct discourse in constructing the model of women's liberation. From these two contents, this paper answers the following questions: Why have Vietnamese men become feminists? What were the causes, purposes, and effects of this phenomenon? To look at the nature of Vietnamese feminism, this paper will show the shifts of masculine domination in Vietnam as another form of protecting men's privileges. All analyses in this study will ground discussion on the economic, political, and social contexts and conditions of Vietnam in the early twentieth century.

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

• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.8-14
• /
• 2006

With an analysis of government owned corporations based on Chinese law as a subject and in the light of comparing and assessing intra-company domination called internal management organization with the domination structure of already established advanced nations, the objective of this study is to analyze the reality and possibility of company domination structure of Chinese government owned corporations. Especially, the intra-company domination structure in China from the points of view such as general meeting of stock holders, director and board of directors, and board of auditors, this study examines the direction toward which internal domination organizations in China form. Also, related to chinese corporations, the study proposes the model in which the possession right of general meeting of stock holders, corporation property right of board of directors, corporation representative right of the senior executive and superintendency of board of auditors are mutually restricted and inter-connected.

• Journal of the Korean Society of Safety
• /
• v.11 no.1
• /
• pp.27-38
• /
• 1996

The aim of this paper is to develop more fast algorithm for evaluation of the reliability of networks and system. It is illustrated with examples. This paper derived the algorithm to calculate the acyclic directed graph G(deals with the problem of the s-t graph). The language PASCAL was used to implement the algorithm. Three Examples are calculated and the calculation time is shorter than the time by program in $\ulcorner$21$\lrcorner.

• East Asian mathematical journal
• /
• v.26 no.3
• /
• pp.423-427
• /
• 2010

In this paper, we give an upper bound for dominations of Steinhaus graphs, and the domination numbers of the bipartite Steinhaus graphs. Also, we give an upper bound for Nordhaus-Gaddum type result for the bipartite Steinhaus graphs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2243-2251
• /
• 2016

In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

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

• Journal of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.759-773
• /
• 2009

A dominating set for a graph G is a set D of vertices of G such that every vertex of G not in D is adjacent to a vertex of D. Reed [11] considered the domination problem for graphs with minimum degree at least three. He showed that any graph G of minimum degree at least three contains a dominating set D of size at most $\frac{3}{8}$ |V (G)| by introducing a covering by vertex disjoint paths. In this paper, by using this technique, we show that every graph on n vertices of minimum degree at least four contains a dominating set D of size at most $\frac{4}{11}$ |V (G)|.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1213-1231
• /
• 2007

The domination number ${\gamma}(G)$ of a graph G=(V,E) is the minimum cardinality of a subset of V such that every vertex is either in the set or is adjacent to some vertex in the set. The bondage number of b(G) of a graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than ${\gamma}(G)$. In this paper, we calculate the bondage number of the Cartesian product of cycles $C_3\;and\;C_n$ for all n.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.295-309
• /
• 2020

Loop transversal codes take an alternative approach to the theory of error-correcting codes, placing emphasis on the set of errors that are to be corrected. Hitherto, the loop transversal code method has been restricted to linear codes. The goal of the current paper is to extend the conceptual framework of loop transversal codes to admit nonlinear codes. We present a natural example of this nonlinearity among perfect single-error correcting codes that exhibit efficient domination in a circulant graph, and contrast it with linear codes in a similar context.