Graphs with Large Hop Roman Domination Number
A subset $S$ of vertices of a graph $G$ is a hop dominating set if every vertex outside $S$ is at distance two from a vertex of $S$. A Roman dominating function on a graph $G=(V,E)$ is a function $f: V(G) \longrightarrow \{0, 1, 2\}$ satisfying the condition that every vertex $u$ for which $f(u...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2019-05-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v27-n1/v27-n1-(pp3-22).pdf |