Computational complexity of domination integrity in graphs
Künye
Sundareswaran, R. & Swaminathan, V. (2015). Computational complexity of domination integrity in graphs. TWMS Journal of Applied and Engineering Mathematics, 5(2), 214-218.Özet
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 (briefly 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.
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
5Sayı
2Bağlantı
https://hdl.handle.net/11729/2563http://jaem.isikun.edu.tr/web/index.php/archive/90-vol5no2/218
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir: