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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Naim Çağman
2024-12-01
|
| Series: | Journal of New Theory |
| Subjects: | |
| Online Access: | https://dergipark.org.tr/en/download/article-file/4089560 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|