Bounds of the signed edge domination number of complete multipartite graphs
Received:April 30, 2022  Revised:July 26, 2022
Key Words: signed edge domination   signed edge domination number   complete multipartite graph  
Fund Project:
Author NameAffiliationAddress
Yancai Zhao Wuxi Environmental Science and Engineering Research Center 江苏省无锡市惠山区钱藕路12号无锡城市学院
Hits: 76
Download times: 0
      A function $f: E(G)\rightarrow\{-1,1\}$ is called a \emph{signed edge dominating function} (SEDF for short) of $G$ if $f[e]=f(N[e])= \sum_{e'\in N[e]}f(e')\geq1$, for every edge $e\in E(G)$. The \emph{signed edge domination number} $\gamma_{s}\,'(G)$ of $G$ is the minimum weight among all signed edge dominating functions of $G$. In this paper, we initiate the study of this parameter for $G$ a complete multipartite graph. we provide the lower and upper bounds of $\gamma_{s}\,'(G)$ for $G$ a complete $r$-partite graph with $r$ even and all parts equal.
  View/Add Comment  Download reader