T. Haynes, S. Hedetniemi and P. Slater, “Funda-mentals of Domination in Graphs,” Marcel Dekker, Inc., New York, 1998.
has been cited by the following article:
TITLE: Some New Results on Domination Integrity of Graphs
AUTHORS: Samir K. Vaidya, Nirang J. Kothari
KEYWORDS: Integrity; Dominating Set; Domination Integrity
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.3, July 18, 2012
ABSTRACT: 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.