Dominating number of distance two of corona products of graphs
<p>Dominating set $S$ in graph $G=(V,E)$ is a subset of $V(G)$ such that every vertex of $G$ which is not element of $S$ are connected and have distance one to $S$. Minimum<span style="text-decoration: underline;"> cardinality</span> among dominating sets in a graph $G$ i...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2016-10-01
|
| Series: | Indonesian Journal of Combinatorics |
| Subjects: | |
| Online Access: | http://www.ijc.or.id/index.php/ijc/article/view/9 |