Convex domination in the composition and cartesian product of graphs
The convex dominating sets in the composition and cartesian product of two connected graphs were characterized. It was shown that the convex domination number ycon (G[H]) of a composition G[H] of two non-complete connected graphs G and H is equal to the clique domination number ycl(G) of G. The conv...
| Yayımlandı: | Transactions of the National Academy of Science and Technology Vol. 33, no. 1 (Jul. 2011), 165 |
|---|---|
| Yazar: | |
| Diğer Yazarlar: | |
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
2011
|
| Konular: |