Some New Results on Domination Integrity of Graphs

• 作者: Nirang J. Kothari Samir K. Vaidya
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: INTEGRITY Dominating SET DOMINATION INTEGRITY
• 年，卷（期）: 2012,（3）
• 页码范围: 96-98
• 页数: 3页
• 分类号: O1

摘要

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.