On distance k-domination number of graphs under product operations

Main Article Content

Bijo S Anand
Jonecis A. Dayap
Leomarich F. Casinillo
Ryan Pepper
Revathy S Nair

Abstract

For a positive integer k, a subset SV(G) is said to be a k-dominating set of G if every vertex vV(G)\S is at a distance of at most k from some vertex of S. The cardinality of the minimum k-dominating set of G is the k-domination number, denoted by γk(G). In this article, we determine the distance k-domination number for two graphs under some product operations in terms of its factor graphs.

Downloads

Download data is not yet available.

Article Details

How to Cite
Bijo S Anand, Jonecis A. Dayap, Leomarich F. Casinillo, Ryan Pepper, & Revathy S Nair. (2025). On distance k-domination number of graphs under product operations. Gulf Journal of Mathematics, 19(1), 117-124. https://doi.org/10.56947/gjom.v19i1.2032
Section
Articles