Vertex Semi Middle Domination in Graphs

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

A set is -set of vertex semi-middle graph, if every vertex not in D is adjacent to a vertex in . The domination number of the vertex semi-middle graph denoted by is the minimum size of -set of vertex semi-middle graph . We study the graph theoretic properties of ) and its exact values for some standard graphs. The relation between with other dominating parameters are also investigated.

Volume 12 | Issue 8

Pages: 83-89

DOI: 10.5373/JARDCS/V12I8/20202449