Split Domination Number in Edge Semi-Middle Graph

Venkanagouda M. Goudar, K.C. Rajendra Prasad, K.M. Niranjan

Abstract

Let G = (p, q) be a connected graph and Me(G) be its corresponding edge semi-middle graph. A dominating set D ⊆ V [Me(G)] is split dominating set <V [Me(G)] – D> is disconnected. The minimum size of D is called the split domination number of Me(G) and is denoted by γs[Me(G)]. In this paper we obtain several results on split domination number.

Full Text:

PDF
Pan-Amer. J. Math. 1 (2022), 13
DOI: https://doi.org/10.28919/cpr-pajm/1-13
This article was published on September 14, 2022 by Mathyze, under a Creative Commons Attribution 4.0 International License.