Computational complexity of domination integrity in graphs

In a graph G, those dominating sets S which give minimum value for |S| + m(G-S), where m(G-S) denotes the maximum order of a component of G-S, are called dominating integrity sets of G (briey called DI-sets of G). This concept combines two important aspects namely domination and integrity in graphs....

Full description

Saved in:
Bibliographic Details
Published in:TWMS journal of applied and engineering mathematics Vol. 5; no. 2; p. 214
Main Authors: Sundareswaran, R, Swaminathan, V
Format: Journal Article
Language:English
Published: Istanbul Turkic World Mathematical Society 01.07.2015
Elman Hasanoglu
Subjects:
Analysis
Complexity
Computation
Computational complexity
Computational mathematics
Data integrity
Decision making
Graph theory
Graphs
Integrity
Mathematical models
United States
ISSN:2146-1147, 2146-1147
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In a graph G, those dominating sets S which give minimum value for |S| + m(G-S), where m(G-S) denotes the maximum order of a component of G-S, are called dominating integrity sets of G (briey called DI-sets of G). This concept combines two important aspects namely domination and integrity in graphs. In this paper, we show that the decision problem domination integrity is NP-complete even when restricted to planar or chordal graphs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2146-1147
2146-1147