Construction of Halin graph with perfect k-ary tree and its independent domination number

Abstract

Halin graphs can be constructed from a tree non degree 2-vertices, embedded in the plane and pendant vertices are connected by outer cycle. This graph is 3- connected planar graph. In this article we formed some special families of Halin graphs with perfect k ary tree and find the independent domination number of those graphs.

Subject Classification:

• 05C05
• 05C69
• 05C40

Keywords:

• Domination number
• Independent Domination number
• Halin Graph