A Study on Fuzzy Graphs: Inverse Clique Regular Domination Number
Main Article Content
Abstract
If V – Dcr(G) contains clique regular dominating set D{\cr(G), then D{\cr(G) is called the inverse clique regular dominating set with regard to Dcr(G). A subset Dcr(G)of a fuzzy graph G=(?,µ) is said to be a clique regular dominating set.The lowest fuzzy cardinality calculated over all minimal inverse clique regular dominating sets of G is known as the inverse clique domination number, or ?\cr(G)
Article Details
How to Cite
Mahadevaswamy B.S. (2015). A Study on Fuzzy Graphs: Inverse Clique Regular Domination Number. International Journal on Recent Technologies in Mechanical and Electrical Engineering, 2(12), 31–35. Retrieved from https://www.ijrmee.org/index.php/ijrmee/article/view/390
Section
Articles