Abstract
A Halin graph H is a planar and three connected graph. The Halin graph is constructed by joining all pendent vertices of tree into cycle. In this article we constructed some special families of Halin graphs and determined 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
