On a Class of Graphs with Large Total Domination Number
Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$. We provide a characterization of a large family of graphs (including chordal graphs) satisfying...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Discrete Mathematics & Theoretical Computer Science
2018-06-01
|
| Serier: | Discrete Mathematics & Theoretical Computer Science |
| Fag: | |
| Online adgang: | https://dmtcs.episciences.org/3304/pdf |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|