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: | |
|---|---|
| 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 |