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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Paper Title
Journal
Date
