Domination Polynomials of Unidirectional Star

Authors

  • Sanal Kumar University of Technology and Applied Sciences, IBRI, Oman
  • Jithin Matthew University of Technology and Applied Sciences, IBRI, Oman

DOI:

https://doi.org/10.59461/ijitra.v2i3.67

Keywords:

Dominating set, Domination polynomial, Digraph, Unidirectional Star Graph

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.

Downloads

Published

2023-09-07

Issue

Vol. 2 No. 3 (2023): IJITRA

Section

Special Issue

License

Copyright (c) 2023 International Journal of Information Technology, Research and Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

How to Cite

Domination Polynomials of Unidirectional Star . (2023). International Journal of Information Technology, Research and Applications, 2(3), 12-16. https://doi.org/10.59461/ijitra.v2i3.67