QR Code

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)$...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux: Mahsa Khatibi, Ali Behtoei
Format: Artigo
Langue:Inglês
Publié: Amirkabir University of Technology 2026-04-01
Collection:AUT Journal of Mathematics and Computing
Sujets:
Accès en ligne:https://ajmc.aut.ac.ir/article_5619_1a4ab15f37a1d2341d947a9996ddfbf7.pdf
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!