Convex domination in the composition and cartesian product of graphs |
| |
| Authors: | Mhelmar A Labendia Sergio R Canoy Jr |
| |
| Institution: | 1. Department of Mathematics, College of Science and Mathematics, Mindanao State University—Iligan Institute of Technology, 9200, Iligan City, Philippines
|
| |
| Abstract: | In this paper we characterize the convex dominating sets in the composition and Cartesian product of two connected graphs. The concepts of clique dominating set and clique domination number of a graph are defined. It is shown that the convex domination number of a composition GH] of two non-complete connected graphs G and H is equal to the clique domination number of G. The convex domination number of the Cartesian product of two connected graphs is related to the convex domination numbers of the graphs involved. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
