• Communications of the Korean Mathematical Society
• /
• v.27 no.4
• /
• pp.843-849
• /
• 2012

Let G = (V, E) be a graph with chromatic number ${\chi}(G)$. dominating set D of G is called a chromatic transversal dominating set (ctd-set) if D intersects every color class of every ${\chi}$-partition of G. The minimum cardinality of a ctd-set of G is called the chromatic transversal domination number of G and is denoted by ${\gamma}_{ct}$(G). In this paper we characterize the class of trees, unicyclic graphs and cubic graphs for which the chromatic transversal domination number is equal to the connected domination number.

• 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 Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.179-186
• /
• 2011

This paper suggests the minimum number of vertex guards algorithm. Given n rooms, the exact number of minimum vertex guards is proposed. However, only approximation algorithms are presented about the maximum number of vertex guards for polygon and orthogonal polygon without or with holes. Fisk suggests the maximum number of vertex guards for polygon with n vertices as follows. Firstly, you can triangulate with n-2 triangles. Secondly, 3-chromatic vertex coloring of every triangulation of a polygon. Thirdly, place guards at the vertices which have the minority color. This paper presents the minimum number of vertex guards using dominating set. Firstly, you can obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, you can obtain dominating set from visibility graph or visibility matrix. This algorithm applies various art galley problems. As a results, the proposed algorithm is simple and can be obtain the minimum number of vertex guards.