Independent transversal equitable domination in graphs
Dhananjaya Murthy B. V., G. Deepak, N. D. Soner · International Mathematical Forum · 2013
A set S ⊆ V of vertices in a graph G = (V, E) is called an equitable dominating set if for every vertex u in V -S there exists at least one vertex v in S adjacent to u and |deg(u)deg(v)| ≤ 1.An equitable dominating set which intersects every maximum independent set in G is called an independent transversal equitable dominating set.The minimum cardinality of an independent transversal equitable dominating set is called the independent transversal equitable domination number of G and is denoted by γ ite (G).In this paper we begin an investigation of this parameter.