Exact double domination in the generalized Sierpiński graphs
A subset $D$ of vertices of a simple graph $G$ is an exact double dominating set if each vertex $v$ of $G$ is dominated by exactly two vertices of $D$, i.e. $|N_G[v]\cap D|=2$, in which $N_G[v]$ is the closed neighborhood of $v$ in $G$. The generalized Sierpiński graph $S(G,t)$...
Shranjeno v:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Amirkabir University of Technology
2026-04-01
|
| Serija: | AUT Journal of Mathematics and Computing |
| Teme: | |
| Online dostop: | https://ajmc.aut.ac.ir/article_5619_1a4ab15f37a1d2341d947a9996ddfbf7.pdf |
| Oznake: |
Brez oznak, prvi označite!
|