Domination Polynomials of Unidirectional Star
DOI:
https://doi.org/10.59461/ijitra.v2i3.67Keywords:
Dominating set, Domination polynomial, Digraph, Unidirectional Star GraphAbstract
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.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 International Journal of Information Technology, Research and Applications
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.