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....

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:TWMS journal of applied and engineering mathematics Ročník 5; číslo 2; s. 214
Hlavní autoři: Sundareswaran, R, Swaminathan, V
Médium: Journal Article
Jazyk:angličtina
Vydáno: Istanbul Turkic World Mathematical Society 01.07.2015
Elman Hasanoglu
Témata:
Analysis
Complexity
Computation
Computational complexity
Computational mathematics
Data integrity
Decision making
Graph theory
Graphs
Integrity
Mathematical models
United States
ISSN:2146-1147, 2146-1147
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2146-1147
2146-1147