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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Naim Çağman
2024-12-01
|
| Schriftenreihe: | Journal of New Theory |
| Schlagworte: | |
| Online-Zugang: | https://dergipark.org.tr/en/download/article-file/4089560 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|