• Dr. A. NOORUL IYNEE
• Mrs SANTHI .S
• Mrs. KIRUTHIKA . J

In graph idea, a dominating set for a graph S = (V, E) is a subset D of V. The domination number γ(S) is the range of vertices in a smallest dominating set for S. The Cartesian product L of graphs S such that, the vertex set of S and L is the Cartesian product and two vertices and are adjoining in S, L if and simplest if both and is adjoining to in L. Vizing's conjecture from 1968 proves that the domination variety of the Cartesian fabricated from graphs is at least as big because the made of their domination numbers. On this paper, the vizing’s conjecture states that for each pair of graphs S, L.

Minus total domination; signed total domination; k-partite graph; Triangle free graph; Hypergraph

"Domination of Graph Based on the Vizing’s Conjecture", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.11, Issue 11, page no.f394-f398, November-2024, Available :http://www.jetir.org/papers/JETIR2411543.pdf

"Domination of Graph Based on the Vizing’s Conjecture", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.11, Issue 11, page no. ppf394-f398, November-2024, Available at : http://www.jetir.org/papers/JETIR2411543.pdf