Computational complexity of domination integrity in graphs

MaRDI QIDQ2832230zbMATH OpenFDO

Authors R. Sundareswaran, Venkata Swaminathan

Publication date 10 November 2016

Published in TWMS Journal of Applied and Engineering Mathematics (Search for Journal in Brave)

zbMATH Keywords

domination integrityintegrityNP-completeness

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Review text

A domination integrity is a variant of the integrity [\textit{K. S. Bagga} et al., Discrete Appl. Math. 37--38, 13--28 (1992; Zbl 0778.05041)] in which the sets over which a minimization is done are restricted to dominating sets. In this paper, NP-completeness of the domination integrity is established. The setting of the paper is unfortunately very unprofessional, hence it is somehow unpleasant to read it.

Recommendations

• On the domination integrity
• Domination integrity of total graphs
• scientific article; zbMATH DE number 4035869
• Domination weak integrity in graphs
• scientific article; zbMATH DE number 718663

Cited in

(4)

• scientific article; zbMATH DE number 718663 (Why is no real title available?)
• scientific article; zbMATH DE number 7310279 (Why is no real title available?)
• Domination integrity of some graph classes
• Application of double domination integrity in PMU placement problem

This page was built for publication: Computational complexity of domination integrity in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2832230)