Signed Roman edge domination numbers in graphs

H. Abdollahzadeh Ahangar (), J. Amjadi, S. M. Sheikholeslami (), L. Volkmann () and Y. Zhao ()
Additional contact information
H. Abdollahzadeh Ahangar: Babol University of Technology
J. Amjadi: Azarbaijan Shahid Madani University
S. M. Sheikholeslami: Azarbaijan Shahid Madani University
L. Volkmann: RWTH-Aachen University
Y. Zhao: Wuxi City College of Vocational Technology

Journal of Combinatorial Optimization, 2016, vol. 31, issue 1, No 22, 333-346

Abstract: Abstract The closed neighborhood $$N_G[e]$$ N G [ e ] of an edge $$e$$ e in a graph $$G$$ G is the set consisting of $$e$$ e and of all edges having a common end-vertex with $$e$$ e . Let $$f$$ f be a function on $$E(G)$$ E ( G ) , the edge set of $$G$$ G , into the set $$\{-1, 1, 2\}$$ { - 1 , 1 , 2 } . If $$ \sum _{x\in N[e]}f(x) \ge 1$$ ∑ x ∈ N [ e ] f ( x ) ≥ 1 for every edge $$e$$ e of $$G$$ G and every edge $$e$$ e for which $$f (e) = -1$$ f ( e ) = - 1 is adjacent to at least one edge $$e'$$ e ′ for which $$f (e')= 2$$ f ( e ′ ) = 2 , then $$f$$ f is called a signed Roman edge dominating function of $$G$$ G . The minimum of the values $$\sum _{e\in E(G)} f(e)$$ ∑ e ∈ E ( G ) f ( e ) , taken over all signed Roman edge dominating functions $$f$$ f of $$G$$ G , is called the signed Roman edge domination number of $$G$$ G and is denoted by $$\gamma _{sR}'(G)$$ γ s R ′ ( G ) . In this note we initiate the study of the signed Roman edge domination in graphs and present some (sharp) bounds for this parameter.

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

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9747-8 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:31:y:2016:i:1:d:10.1007_s10878-014-9747-8

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

DOI: 10.1007/s10878-014-9747-8

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 ().