Abstract
Let be a finite directed graph without isolated node. The domination polynomial of is defined by D(G, x) where d(G, i)is the cardinality of the set of dominating sets of with nodes. In this paper, we study the domination polynomial of unidirectional star 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: International Journal of Information Technology, Research and Applications
Paper Title
Journal
Date
