Author(s)

Samir K. Vaidya, Nirang J. Kothari

B. H. Gardi college of Engineering & Technology, Rajkot, India.
Saurashtra University, Rajkot, India.

The domination integrity of a connected graph G= (V(G), E(G)) is denoted as DI(G) and defined by DI(G) = min{*S*+ m(G-S) : S is a dominating set } where m(G-S) is the order of a maximum component of G-S . We discuss domination integrity in the context of some graph operations like duplication of an edge by vertex and duplication of vertex by an edge.

Integrity; Dominating Set; Domination Integrity

Vaidya, S. and Kothari, N. (2012) Some New Results on Domination Integrity of Graphs. Open Journal of Discrete Mathematics, 2, 96-98. doi: 10.4236/ojdm.2012.23018.