On Triangular Secure Domination Number
Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m). A dominating set T of V(T_m) is a secure do...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
UIN Syarif Hidayatullah
2020-09-01
|
| Series: | InPrime |
| Subjects: | |
| Online Access: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/15996 |