Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{160760,
        author = {Dr. M.H. Muddebihal and Shobha Mahadevappa},
        title = {Regular Restrained Domination in Middle Graph},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {10},
        number = {1},
        pages = {1345-1348},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=160760},
        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. },
        keywords = {Graph, middle graph, dominating set, restrained dominating set, regular restrained domination number. },
        month = {},
        }