Abstract
In this paper, we bring together the idea of an inverse domination in bipolar fuzzy graphs (BFG). A set I⊆Vis supposed to be an inverse dominating set IDS in BFG’s G(V,E) if D⊆V is a dominating set of G and I⊆(V-D) is a dominating set of V-D. The least among all the IDS’s is called an inverse domination number γB-1(G) of G(V,E). Further study the bounds and characteristic of an inverse domination number (IDN) in various BFG.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
