The domination number of graph is the smallest cardinality set G. A subset a vertex S G called if every element dominates G, meaning that not an connected and one distance from S. has become interesting research studies on several graphs k -connected such as circulant graphs, grids, wheels. This study aims to determine other k-connected Harary graph. method used pattern detection axiomatic dedu...

In this paper, we show that the Italian domination number of every lexicographic product graph G ○ H can be expressed in terms five different parameters . These defined under following unified approach, which encompasses definition several well-known and introduces new ones. Let N ( v ) denote open neighbourhood ∈ V , let w = 0 1 …, l a vector nonnegative integers such ≥ We say function f : → {...