A Review on Relationship between Domination Independent Transversal Domination and Equitable Domination in Graphs

Abstract

A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V − S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. In this paper we begin an investigation of relationship between domination, independent transversal domination and equitable domination in graphs.