Characterization of trees with Roman bondage number 1
Let $G=(V,E)$ be a simple undirected graph. A Roman dominating function on $G$ is a function $f: V\to \{0,1,2\}$ satisfying the condition that every vertex $u$ with $f(u)=0$ is adjacent to at least one vertex $v$ with $f(v)=2$. The weight of a Roman dominating function is the value $f(G)=\sum_{u\in...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2020-08-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/10.3934/math.2020397/fulltext.html |