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...
| 出版年: | Transactions of the National Academy of Science and Technology Vol. 33, no. 1 (Jul. 2011), 165 |
|---|---|
| 第一著者: | |
| その他の著者: | |
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
2011
|
| 主題: |