Double total domination number in certain chemical graphs
Let $ G $ be a graph with the vertex set $ V(G) $. A set $ D\subseteq V(G) $ is a total k-dominating set if every vertex $ v\in V(G) $ has at least $ k $ neighbours in $ D $. The total k-domination number $ \gamma_{kt}(G) $ is the cardinality of the smallest total k-dominating set. For $ k = 2 $ the...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-09-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.20221076?viewType=HTML |