On the Domination Integrity
Makaleler > Tam Makale · 2019
Yazarlar: Huseyin Tokat, Alpay KIRLANGIÇ
International Journal of Foundations of Computer Science, SCI Expanded İndekslerine Giren Dergi, Uluslararası, Wos, 2019, cilt 30, ss 811-826
DOI: 10.1142/s0129054119500230
Özet
The domination integrity of graph G is defined by [Formula: see text] where [Formula: see text] denotes the order of the largest component in [Formula: see text]. This parameter is a measures of vulnerability of a graph. In this paper, we determine the domination integrity of middle graph of graph [Formula: see text], graph [Formula: see text] and graph [Formula: see text]. We also obtain some results for cartesian product and corona.