Computing the CD-Number of Strong Product of Graphs
摘要
In this work, we carry over the study of corona domination in graphs for the strong product of graphs. We investigate the strong product involving paths, cycles, complete graph, complete bipartite graph, etc.