• 대한수학회논문집
• /
• 제32권4호
• /
• pp.1077-1097
• /
• 2017

In this research article, we introduce certain concepts, including domination, total domination, strong domination, weak domination, edge domination and total edge domination in m-polar fuzzy graphs. We describe these concepts by several examples. We investigate some related properties of certain dominations in m-polar fuzzy graphs. We also present a decision making method based on domination in m-polar fuzzy graphs.

• Journal of applied mathematics & informatics
• /
• 제41권4호
• /
• pp.741-752
• /
• 2023

A new variant of vertex edge domination, namely semi total vertex edge domination has been introduced in the present paper. A subset S of the vertex set V of a graph G is said to be a semi total vertex edge dominating set(stved - set), if it is a vertex edge dominating set of G and each vertex in S is within a distance two of another vertex in S. An stved-set of G having minimum cardinality is said to be an γ_stve(G)- set and its cardinality is denoted by γ_stve(G). Bounds for γ_stve(G) - set have been given in terms of various graph theoretic parameters and graphs attaining the bounds have been characterized. In particular, bounds for trees have been obtained and extremal trees have been characterized.

• Korean Journal of Mathematics
• /
• 제31권4호
• /
• pp.505-519
• /
• 2023

Let G = (V, E) be a graph. A subset S of V is called a dominating set of G if every vertex not in S is adjacent to some vertex in S. The domination number γ(G) of G is the minimum cardinality taken over all dominating sets of G. A dominating set S is called a connected dominating set if the subgraph induced by S is connected. The minimum cardinality taken over all connected dominating sets of G is called the connected domination number of G, and is denoted by γ_c(G). In this paper, we investigate the Nordhaus-Gaddum type results for the connected domination number and its derived graphs like line graph, subdivision graph, power graph, block graph and total graph, and characterize the extremal graphs.

• 대한수학회지
• /
• 제48권3호
• /
• pp.551-563
• /
• 2011

Let ${\kappa}$ be a positive integer and let G be a simple graph with vertex set V(G). A function f : V (G) ${\rightarrow}$ {-1, 1} is called a signed total ${\kappa}$-dominating function if ${\sum}_{u{\in}N({\upsilon})}f(u){\geq}{\kappa}$ for each vertex ${\upsilon}{\in}V(G)$. A set ${f_1,f_2,{\ldots},f_d}$ of signed total ${\kappa}$-dominating functions of G with the property that ${\sum}^d_{i=1}f_i({\upsilon}){\leq}1$ for each ${\upsilon}{\in}V(G)$, is called a signed total ${\kappa}$-dominating family (of functions) of G. The maximum number of functions in a signed total ${\kappa}$-dominating family of G is the signed total k-domatic number of G, denoted by $d^t_{kS}$(G). In this note we initiate the study of the signed total k-domatic numbers of graphs and present some sharp upper bounds for this parameter. We also determine the signed total signed total ${\kappa}$-domatic numbers of complete graphs and complete bipartite graphs.

• 대한수학회보
• /
• 제58권6호
• /
• pp.1409-1418
• /
• 2021

In this paper, we study domination in the zero-divisor graph of a *-ring. We first determine the domination number, the total domination number, and the connected domination number for the zero-divisor graph of the product of two *-rings with componentwise involution. Then, we study domination in the zero-divisor graph of a Rickart *-ring and relate it with the clique of the zero-divisor graph of a Rickart *-ring.

• 대한수학회보
• /
• 제56권4호
• /
• pp.1059-1075
• /
• 2019

Let G be a graph with no isolated vertex. A total dominating set, abbreviated TDS of G is a subset S of vertices of G such that every vertex of G is adjacent to a vertex in S. The total domination number of G is the minimum cardinality of a TDS of G. In this paper, we study the total domination number of central graphs. Indeed, we obtain some tight bounds for the total domination number of a central graph C(G) in terms of some invariants of the graph G. Also we characterize the total domination number of the central graph of some families of graphs such as path graphs, cycle graphs, wheel graphs, complete graphs and complete multipartite graphs, explicitly. Moreover, some Nordhaus-Gaddum-like relations are presented for the total domination number of central graphs.

• 한국농공학회논문집
• /
• 제52권4호
• /
• pp.19-26
• /
• 2010

To provide the basic information for the water quality management of the Sumjin River Basin, delivery ratios for flow duration were studied. Using the day-interval data set of discharge and water quality observed from the Chooryeong-cheon watershed, the flow-duration and discharge-load relation curves for the watershed were established, then the load-duration curve was constructed. Delivery ratios for flow duration were also developed. Delivery ratios showed wide variation according to flow conditions. In general, delivery ratio of high flow condition showed higher value reflecting nonpoint source pollution contribution from the forest dominating watershed. To resolve this problem, a regression model explaining the relation between flow rate and delivery ratio was suggested. The delivery ratios for different flow regime could be used for pollutant load estimation and TMDL (Total maximum daily load) development.

• 말소리와 음성과학
• /
• 제9권1호
• /
• pp.19-26
• /
• 2017

The main objective of this study is to investigate the influence of utterance internal pause in English speaking evaluation. To avoid possible confusion with other errors caused by segmental and prosodic inaccuracy, stem utterances with two different length obtained from a native speaker were manipulated to make a set of stimuli tokens through insertion of pauses whose length and position vary. After a total of 90 participants classified into three proficiency groups rated the stimuli, the scored data set was statistically analyzed in terms of the mixed effects model. It was confirmed that predictors such as pause length, pause position and utterance length significantly influence raters' evaluation scores. Especially, a dominating effect was found in such a way that raters gradually deducted scores in accordance with the increase of pause duration. In another experiment, a tree-based statistical learning technique was utilized to check which of the significant predictors played a more influential role than others. The findings in this paper are expected to be practically informative for both the test takers who are preparing for an English speaking test and the raters who desire to develop more objective rubric of speaking evaluation.

• 한국산림과학회지
• /
• 제52권1호
• /
• pp.58-71
• /
• 1981

충남(忠南) 전북지방(全北地方) 적송림(赤松林)의 천이과정(遷移過程)을 연구(研究)하기 위하여 솔잎혹파리의 피해지속기간(被害持續期間)에 따라 피해극기지(被害極基地) (5년전(年前)에 피해발생(被害発生))인 공주(公州)(A), 피해지속지(被害持續地)(10년전(年前)에 피해발생(被害発生))인 부여(扶餘)(B), 피해회복지(被害回復地)(20년전(年前)에 피해발생(被害発生))로서 고창지역(高敞地域)(C)을 조사지역(調査地域)으로 설정(設定)하고, 각(各) 조사지역별(調査地域別)로 환경요인(環境要因)과 식생상태(植生狀態)를 調査하여, 환경요인(環境要因)과 식생상태(植生狀態), 삼림군집(森林群集)의 비교(比較), 식물상(植物相)의 변화(変化) 등(等)을 분석(分析)한 결과(結果)를 요약(要約)하면 다음과 같다 1. 임분(林分)이 솔잎혹파리피해(被害)로 부터 회복(回復)되어 감에 따라 식생구성(植生構成)에 변화(変化)가 오고 대상수종(代償樹種)으로 발달(発達)된 참나무류(類)의 상대우점치(相対優点値)가 감소(減小)되었다. 그러나 본(本) 조사지역내(調査地域內)에서는 상수리나무의 상대우점치(相対優点値)가 다른 참나무류(類) 보다 높았다. 2. 솔잎혹파리피해(被害)가 지속(持續)됨에 따라 삼림군집(森林群集)의 종구성상태(種構成狀態)가 점차 다양(多樣)하여진다. 그후 피해(被害)가 회복(回復)됨에 따라 임분(林分)의 종구성상태(種構成狀態)는 단순화(单純化)되는 것으로 나타났다. 3. 상대밀도(相対密度) 및 상대우점치(相対優点値)의 상대치(相対値)에 의(依)한 식생천이(植生遷移)를 종합분석(綜合分析)한 결과(結果) 솔잎혹파리피해(被害)의 극심(極甚)에서 우점종(優点種)을 이루던 참나무류(類)가 피해(被害)로부터 회복(回復)되어감에 따라 그 값이 감소(減少)되고, 싸리류(類), 진달래류(類) 등(等)이 하층식생(下層植生)을 형성(形成)하는 삼림군집(森林群集)으로 변화(変化)하여 갔다. 4. 식생(植生)에 미친 토심(土深), 토양함수량(土壤含水量), 유기물함량(有機物含量), 그리고 유기물층(有機物層)의 두께는 본(本) 조사대상지(調査対象地)의 범위내에 있어서는 거의 같은 것으로 사료(思料)되었고 연평균강수량(年平均降水量)과 온도(温度)도 유사(類似)하였다고 본다.