Construction of Non-isomorphic Families of Halin Graphs with Same Split Domination Numbers

Split domination number of a graph is the cardinality of a minimum dominating set whose removal disconnects the graph. In this paper, we define a special family of Halin graphs and determine the split domination number of those graphs. We show that the construction yield non-isomorphic families of Halin graphs but with same split domination numbers.