On the nonnegative signed domination numbers in graphs
<p>A nonnegative signed dominating function (NNSDF) of a graph $G$<br />is a function $f$ from the vertex set $V(G)$ to the set $\{-1,1\}$<br />such that $\sum_{u\in N[v]}f(u)\ge 0$ for every vertex $v\in<br />V(G)$. The nonnegative signed domination number of $G$, denoted by...
Main Authors: | Maryam Atapour, Seyyed Mahmoud Sheikholeslami |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2016-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/112 |
Similar Items
-
Lower bounds on nonnegative signed domination parameters in graphs
by: Arezoo. N. Ghameshlou
Published: (2020-01-01) -
Nonnegative signed total Roman domination in graphs
by: Nasrin Dehgardi, et al.
Published: (2020-12-01) -
Bounds on the inverse signed total domination numbers in graphs
by: M. Atapour, et al.
Published: (2016-01-01) -
Signed Total Roman Edge Domination In Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-11-01) -
On the signed Italian domination of graphs
by: Ashraf Karamzadeh, et al.
Published: (2019-09-01)