Split Domination Number in Edge Semi-Middle Graph

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

doi:10.28919/cpr-pajm/1-13

Research article

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 M_e(G) be its corresponding edge semi-middle graph. A dominating set D ⊆ V [M_e(G)] is split dominating set <V [Me(G)] – D> is disconnected. The minimum size of D is called the split domination number of M_e(G) and is denoted by γ_s[M_e(G)]. In this paper we obtain several results on split domination number.

How to cite

V. M. Goudar, K. C. R. Prasad, K. M. Niranjan, Split Domination Number in Edge Semi-Middle Graph, Pan-Amer. J. Math. 1 (2022), 13. https://doi.org/10.28919/cpr-pajm/1-13

BibTeX

@article{Goudar2022,
  author  = {Goudar, Venkanagouda M. and Prasad, K.C. Rajendra and Niranjan, K.M.},
  title   = {Split Domination Number in Edge Semi-Middle Graph},
  journal = {Pan-Amer. J. Math.},
  volume  = {1},
  year    = {2022},
  pages   = {13},
  doi     = {10.28919/cpr-pajm/1-13}
}