DOMINATION AND EDGE DOMINATION IN TREES
Let \(G=(V,E)\) be a simple graph. A set \(S\subseteq V\) is a dominating set if every vertex in \(V \setminus S\) is adjacent to a vertex in \(S\). The domination number of a graph \(G\), denoted by \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). A set \(D \subseteq E\) is an...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Ural Branch of the Russian Academy of Sciences and Ural Federal University named after the first President of Russia B.N.Yeltsin, Krasovskii Institute of Mathematics and Mechanics
2020-07-01
|
| Serier: | Ural Mathematical Journal |
| Fag: | |
| Online adgang: | https://umjuran.ru/index.php/umj/article/view/223 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|