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.
展开▼
