• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.245-250
• /
• 2020

Let γt(G) and τ(G) denote the total domination number and vertex cover number of graph G, respectively. In this paper, we study the total domination number of the central tree C(T) for a tree T. First, a relationship between the total domination number of C(T) and the vertex cover number of tree T is discussed. We characterize the central trees with equal total domination number and independence number. Applying the first result, we improve the upper bound on the total domination number of C(T) and solve one open problem posed by Kazemnejad et al..

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.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.

• Communications of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.359-366
• /
• 2014

A three-valued function f defined on the vertices of a digraph D = (V, A), $f:V{\rightarrow}\{-1,0,+1\}$ is a minus total dominating function(MTDF) if $f(N^-(v)){\geq}1$ for each vertex $v{\in}V$. The minus total domination number of a digraph D equals the minimum weight of an MTDF of D. In this paper, we discuss some properties of the minus total domination number and obtain a few lower bounds of the minus total domination number on a digraph D.

• Korean Journal of Mathematics
• /
• v.31 no.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.

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

• Communications of the Korean Mathematical Society
• /
• v.28 no.4
• /
• pp.857-863
• /
• 2013

In this paper, we prove that the total domination number of a $P_6$-free graph of order $n{\geq}3$ and minimum degree at least one which is not the cycle of length 6 is at most $\frac{n+1}{2}$, and the bound is sharp.

• Journal of the Korean Mathematical Society
• /
• v.48 no.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.

• The Korean Journal of Ecology
• /
• v.19 no.3
• /
• pp.251-260
• /
• 1996

The effect of forest fire on soil microarthropod fauna was investigated in the Inhoo Park, located at Deokjin-gu, Chonju city, where fire burned about 2 hectares on April 5, 1994. Vegetation of the area was covered with mixed forest such as 20 to 30 year old black locust, alder, and pine gree, etc., and also rich in understory plants, dead leaves, twigs, etc. The soil samples were taken from burnt soil and near-by control site on April 10, June 6 and Oct. 22 in 1994, and June 26, 1995. Soil microarthropods were extracted using Tullgren apparatus for 72 hours. Soil microarthropods collected in this experiment were 8, 013 at control and 3, 805 at the burnt site making a total of 11, 818 from 5 classes. Therefore, appearance of microarthropods was reduced to 52.5% at burnt site. Dominant animal groups were Acari (45%) and collembola (46%). The reduced rate of soil animal density by fire damage was 52.5% of the total soil microarthropods accounting 36% in Acari and 70% in collembola. The reduction of soil animal density by fire was 65.3% by habitat destruction and 51.7% by diret shock from fire heat. In Collembola, 89% was reduced by habitat destruction. Oribatid mites collected at sample plots included 29 families, 47 genera and 58 species. Forty-two species at burnt site and 47 species at unburnt site were identified, of these 32 being common species at both sites. The density ratio of soil animals at the burnt sites and those at unburnt sites was 38.6% va 61.4% resulting in 37% reduction due to fire. The dominant species with more than 5% in relative density were Trichogalumna nipponica (7.3%) and Eremobelba japonica (5.8%) at unburnt site, shereas 5 species including Eohypochthonius crassisetiger (8.5%) at the burnt site. The number of these species were 32.1% of total number. MGP analysis based on the number of oribatid mites indicated GP type at both unburnt and burnt sites, revealing domination of the P group in oribatid mites.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.379-395
• /
• 2018

Assume that R is a commutative ring with non-zero identity which is not an integral domain. An ideal I of R is called an annihilating ideal if there exists a non-zero element $a{\in}R$ such that Ia = 0. S. Visweswaran and H. D. Patel associated a graph with the set of all non-zero annihilating ideals of R, denoted by ${\Omega}(R)$, as the graph with the vertex-set $A(R)^*$, the set of all non-zero annihilating ideals of R, and two distinct vertices I and J are adjacent if I + J is an annihilating ideal. In this paper, we study the relations between the diameters of ${\Omega}(R)$ and ${\Omega}(R[x])$. Also, we study the relations between the diameters of ${\Omega}(R)$ and ${\Omega}(R[[x]])$, whenever R is a Noetherian ring. In addition, we investigate the relations between the diameters of this graph and the zero-divisor graph. Moreover, we study some combinatorial properties of ${\Omega}(R)$ such as domination number and independence number. Furthermore, we study the complement of this graph.