Domatic Number Graf Middle dari Graf Lingkaran, Graf Kipas dan Graf Roda

Abstract

A dominating set of a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to some vertex in D. The domatic partition of G is the partition of vertices V (G) into disjoint dominating set. The maximum cardinality of disjoint dominating set is called domatic number. The maximum size of the domatic partition is called the domatic number. The upper bound for the domatic number of a graph G is last the equal then minimal degree of G plus one. The purpose of this reserch is finding the domatic number of middle graph of some class graph namely circle, fan and wheel. We obtain, domatic number of this graph is equal to minimal degree of G plus one.