• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.149-156
• /
• 2006

The circular list coloring is a circular version of list colorings of graphs. Let $\chi_{c,l}$ denote the circular choosability(or the circular list chromatic number). In this paper, the circular choosability of outer planar graphs and odd wheel is discussed.

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