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." JAEM 2015, Vol 5, No 2 için listeleme
Toplam kayıt 1, listelenen: 1-1
-
Computational complexity of domination integrity in graphs
(Işık University Press, 2015)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 ...