Computing the CD-Number of Strong Product of Graphs

EasyChair Preprint 8387

Abstract

The concept of corona domination number was introduced by G.Mahadevan et al., 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, and complete and complete bipartite graphs. We have determined the exact values γ(CD)(Pr ⊠ Ps), γCD(Pr ⊠ Ks), γCD(Cr ⊠ Cs),  γCD(Pr ⊠ K1,s).

Keyphrases: Domination number, Pendant vertex, Strong product, corona domination number, support vertex

@booklet{EasyChair:8387,
  author    = {Loganathan Praveenkumar and G Mahadevan and Chockalingam Sivagnanam and S Anuthiya and Selvam Kaviya},
  title     = {Computing the CD-Number of Strong Product of Graphs},
  howpublished = {EasyChair Preprint 8387},
  year      = {EasyChair, 2022}}