On the signed Roman edge $k$-domination in graphs
Let $k\geq 1$ be an integer, and $G=(V,E)$ be a finite and simple graph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph $G$ is the set consisting of $e$ and all edges having a common end-vertex with $e$. A signed Roman edge $k$-dominating function (SREkDF) on a graph $G...
Main Author: | A. Mahmoodi |
---|---|
Format: | Article |
Language: | English |
Published: |
Azarbaijan Shahide Madani University
2017-01-01
|
Series: | Communications in Combinatorics and Optimization |
Subjects: | |
Online Access: | http://comb-opt.azaruniv.ac.ir/article_13642.html |
Similar Items
-
Signed Roman Edge k-Domination in Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-02-01) -
Signed Total Roman Edge Domination In Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-11-01) -
Complexity of signed total $k$-Roman domination problem in graphs
by: Saeed Kosari, et al.
Published: (2021-11-01) -
Signed total Roman $k$-domination in directed graphs
by: N. Dehgard, et al.
Published: (2016-06-01) -
The Signed Total Roman k-Domatic Number Of A Graph
by: Volkmann Lutz
Published: (2017-11-01)