Computational complexity of domination integrity in graphs (Q2832230)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6651422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of domination integrity in graphs |
scientific article; zbMATH DE number 6651422 |
Statements
10 November 2016
0 references
integrity
0 references
domination integrity
0 references
NP-completeness
0 references
Computational complexity of domination integrity in graphs (English)
0 references
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.
0 references
0.8030499815940857
0 references
0.7946261763572693
0 references
0.7866883873939514
0 references
