| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 747 8 |
| Ultima descărcare din IBN: 2024-04-17 20:03 |
| Căutarea după subiecte similare conform CZU |
| 519.16+519.2 (1) |
| Комбинаторный анализ. Теория графов (115) |
| Теория вероятностей и математическая статистика (80) |
 SM ISO690:2012RAD, NaderJafari, SHARIFI, Elahe. Bounds on Global Total Domination in Graphs. In: Computer Science Journal of Moldova, 2015, nr. 1(67), pp. 3-10. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(67) / 2015 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.16+519.2 | ||||||
| Pag. 3-10 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
A subset S of vertices in a graph G is aglobal total dominating set, or just GTDS, if $S$ is a total dominating set of both G and $\overline{G}$. The global total domination number $\gamma_{gt}(G)$ of G is the minimum cardinality of a GTDS of G. We present bounds for the global total domination number in graphs. |
||||||
| Cuvinte-cheie Domination, Total domination, Global total domination.Domination, Total domination, Global total domination. |
||||||
|
|
|
|
