Author Login IJIRT Partner Network (IPN) Login

Regular Restrained Domination in Middle Graph

  • Unique Paper ID: 160760
  • Volume: 10
  • Issue: 1
  • PageNo: 1345-1348
  • 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.
Download article email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 10
  • Issue: 1
  • PageNo: 1345-1348

Regular Restrained Domination in Middle Graph

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry