article Open Access
Nonsplit domination number in vertex semi-middle graph
International Journal of Statistics and Applied Mathematics · 2022 · Vol. 7(4) · pp. 105–109
Niranjan KM✉(Sri Siddhartha Medical College)Rajendra Prasad KC(University B.D.T College of Engineering)Venkanagouda M Goudar(University B.D.T College of Engineering)
Abstract
Let G(p, q) be a connected graph and Mv (G) be its corresponding vertex semi middle graph. A dominating set D⊆V[Mv (G)] is Nonsplit dominating set 〈V[Mv (G)]-D〉 is connected. The minimum size of D is called the Nonsplit domination number of Mv (G) and is denoted by γns [Mv (G)]. In this paper we obtain several results on Nonsplit domination number.
Advanced Graph Theory ResearchVertex (graph theory)GraphCombinatoricsDominating setPhysicsDomination analysisMathematics
Citations
0
FWCI
0.00
field-weighted impact
References
18
Percentile
14%
vs. same field & year
Citation Network
How this paper connects to the literature. Drag to explore, click any node to open that paper.