Perfect Outer-connected Domination in the Join and Corona of Graphs
Let 𝐺 be a connected simple graph. A dominating set 𝑆 ⊆ 𝑉(𝐺) is called a perfect dominating set of 𝐺 if each 𝑢 ∈ 𝑉 𝐺 ∖ 𝑆 is dominated by exactly one element of 𝑆. A set 𝑆 of vertices of a graph 𝐺 is an outer-connected dominating set if every vertex not in 𝑆 is adjacent to some vertex in 𝑆 and the su...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Center for Policy, Research and Development Studies
2016-12-01
|
| Series: | Recoletos Multidisciplinary Research Journal |
| Subjects: | |
| Online Access: | https://rmrj.usjr.edu.ph/rmrj/index.php/RMRJ/article/view/165 |