Graphs with Total Domination Number Double of the Matching Number
A subset $S$ of vertices of a graph $G$ with no isolated vertex is called a total dominating set of $G$ if each vertex of $G$ has at least one neighbor in the set $S$. The total domination number $\gamma_t(G)$ of a graph $G$ is the minimum value of the size of a total dominating set of $G$. A subset...
-д хадгалсан:
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Naim Çağman
2024-12-01
|
| Цуврал: | Journal of New Theory |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://dergipark.org.tr/en/download/article-file/4089560 |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|