A note on the edge Roman domination in trees
<p>A subset $X$ of edges of a graph $G$ is called an \textit{edge<br />dominating set} of $G$ if every edge not in $X$ is adjacent to<br />some edge in $X$. The edge domination number $\gamma'(G)$ of $G$ is the minimum cardinality taken over all edge dominating sets of $G$. An...
Main Author: | Nader Jafari Rad |
---|---|
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
2017-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/234 |
Similar Items
-
Strong Equality Between the Roman Domination and Independent Roman Domination Numbers in Trees
by: Chellali Mustapha, et al.
Published: (2013-05-01) -
Signed Total Roman Edge Domination In Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-11-01) -
Bounds on the Locating Roman Domination Number in Trees
by: Jafari Rad Nader, et al.
Published: (2018-02-01) -
Quadruple Roman Domination in Trees
by: Zheng Kou, et al.
Published: (2021-07-01) -
Signed Roman Edge k-Domination in Graphs
by: Asgharsharghi Leila, et al.
Published: (2017-02-01)