Regular Restrained Domination in Middle Graph
Dr. M.H. Muddebihal, Shobha Mahadevappa
Graph, middle graph, dominating set, restrained dominating set, regular restrained domination number.
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

Conference Alert


AICTE Sponsored National Conference on Smart Systems and Technologies

Last Date: 25th November 2023

SWEC- Management


Last Date: 7th November 2023

Go To Issue

Call For Paper

Volume 10 Issue 1

Last Date for paper submitting for March Issue is 25 June 2023

About Us enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on

Social Media

Google Verified Reviews