Signed mixed Roman domination numbers in graphs

H. Abdollahzadeh Ahangar (), L. Asgharsharghi (), S. M. Sheikholeslami () and L. Volkmann ()
Additional contact information
H. Abdollahzadeh Ahangar: Babol University of Technology
L. Asgharsharghi: Azarbaijan Shahid Madani University
S. M. Sheikholeslami: Azarbaijan Shahid Madani University
L. Volkmann: RWTH Aachen University

Journal of Combinatorial Optimization, 2016, vol. 32, issue 1, No 20, 299-317

Abstract: Abstract Let $$G = (V;E)$$ G = ( V ; E ) be a simple graph with vertex set $$V$$ V and edge set $$E$$ E . A signed mixed Roman dominating function (SMRDF) of $$G$$ G is a function $$f: V\cup E\rightarrow \{-1,1,2\}$$ f : V ∪ E → { - 1 , 1 , 2 } satisfying the conditions that (i) $$\sum _{y\in N_m[x]}f(y)\ge 1$$ ∑ y ∈ N m [ x ] f ( y ) ≥ 1 for each $$x\in V\cup E$$ x ∈ V ∪ E , where $$N_m[x]$$ N m [ x ] is the set, called mixed closed neighborhood of $$x$$ x , consists of $$x$$ x and the elements of $$V\cup E$$ V ∪ E adjacent or incident to $$x$$ x (ii) every element $$x\in V\cup E$$ x ∈ V ∪ E for which $$f(x) = -1$$ f ( x ) = - 1 is adjacent or incident to at least one element $$y\in V\cup E$$ y ∈ V ∪ E for which $$f(y) = 2$$ f ( y ) = 2 . The weight of a SMRDF $$f$$ f is $$\omega (f)=\sum _{x\in V\cup E}f(x)$$ ω ( f ) = ∑ x ∈ V ∪ E f ( x ) . The signed mixed Roman domination number $$\gamma _{sR}^*(G)$$ γ s R ∗ ( G ) of $$G$$ G is the minimum weight of a SMRDF of $$G$$ G . In this paper we initiate the study of the signed mixed Roman domination number and we present bounds for this parameter. In particular, we determine this parameter for some classes of graphs.

Keywords: Signed Roman dominating function; Signed Roman domination number; Signed mixed Roman dominating function; Signed mixed Roman domination number; 05C69 (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9879-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9879-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-015-9879-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().