Computational Complexity of Domination Integrity in Graphs

- R.SUNDARESWARAN; - V.SWAMİNATHAN

Makale detayları

Computational Complexity of Domination Integrity in Graphs

Yazarlar:

- R.SUNDARESWARAN | - V.SWAMİNATHAN

Yayıncı:

Turkic World Mathematical Society

Dergi:

TWMS Journal of Applied and Engineering Mathematics 2015 Vol.5 Issue 2, pp.214-218

Belge Tipi:

Makale

Yayın Tarihi:

11/2015

Belge Dili:

İngilizce

Document ID (Org No.):

2000746226

Sıklık:

Aylık

eISSN:

2587-1013

pISSN:

2146-1147

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

Makale detayları

Computational Complexity of Domination Integrity in Graphs

Yazarlar: - R.SUNDARESWARAN | - V.SWAMİNATHAN

Yayıncı: Turkic World Mathematical Society

Dergi: TWMS Journal of Applied and Engineering Mathematics 2015 Vol.5 Issue 2, pp.214-218

Belge Tipi: Makale

Yayın Tarihi: 11/2015

Belge Dili: İngilizce

Document ID (Org No.): 2000746226

Sıklık: Aylık

eISSN: 2587-1013

pISSN: 2146-1147

Sayı

Yazarlar:

- R.SUNDARESWARAN | - V.SWAMİNATHAN

Yayıncı:

Turkic World Mathematical Society

Dergi:

TWMS Journal of Applied and Engineering Mathematics 2015 Vol.5 Issue 2, pp.214-218

Belge Tipi:

Makale

Yayın Tarihi:

11/2015

Belge Dili:

İngilizce

Document ID (Org No.):

2000746226

Sıklık:

Aylık

eISSN:

2587-1013

pISSN:

2146-1147