On the Domination Integrity


Tokat H., Kırlangıç A.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, cilt.30, ss.811-826, 2019 (SCI İndekslerine Giren Dergi)

  • Cilt numarası: 30
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1142/s0129054119500230
  • Dergi Adı: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
  • Sayfa Sayısı: ss.811-826

Özet

The domination integrity of graph G is defined by DI(G) = min{vertical bar S vertical bar m(G - S) : S is a dominating set of G} where m(G - S) denotes the order of the largest component in G - S. This parameter is a measures of vulnerability of a graph. In this paper, we determine the domination integrity of middle graph of graph B-n, graph E-p(t) and graph H-n(2).We also obtain some results for cartesian product and corona.