Regular Restrained Domination in Middle Graph

Regular Restrained Domination in Middle Graph
Author(s):
Dr. M.H. Muddebihal, Shobha Mahadevappa
Keywords:
Graph, middle graph, dominating set, restrained dominating set, regular restrained domination number.
Abstract
In this paper, we introduce the new concept called regular restrained domination in middle graph. A set S ⊆ V[M(G)] is a restrained dominating set if every vertex in V-S is adjacent to a vertex in S and another vertex in V-S. Note that every graph has a restrained dominating set, since S=V is such a set. Let γrr[M(G)] denote the size of a smallest restrained dominating set. Also we study the graph theoretic properties of γrr[M(G)] and many bounds were obtained in terms of elements of G and its relationships with other domination parameters were found.
Article Details
Unique Paper ID: 160760 Publication Volume & Issue: Volume 10, Issue 1 Page(s): 1345 - 1348
Article Preview & Download

Share This Article

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org