ON SIGNED (NON-NEGATIVE) MAJORITY TOTAL DOMINATION OF SOME GRAPHS

V. Gopal and B. Boomadevi

  DOI:
  https://doi.org/10.37418/amsj.9.4.62

Full Text

For a simple graph $G=(V;E)$, a two valued function $h:V\rightarrow\{-1,1\}$ is called a (non-negative) majority total dominating function if the sum of its function values over at least half the open neighborhoods is at least (zero) one. A (non-negative) majority total domination number of a graph G is the minimum value of $\sum_{v\in V(G)}h(v)$ over all (non-negative) majority total dominating functions $f$ of $G$ and it is denoted by $(\gamma_{maj}^{nt} (G)) \gamma_{maj}^{t} (G)$. In this paper, we have obtained exact value of majority total domination number and non-negative majority total domination number of some prism related graphs.


Keywords:
Majority domination, Majority total domination, non-negative majority total domination.