In this paper we can try to find a relationship between two different disciplines as theory
of domination and operation research. In that concern we can try to make, a domination model for
linear programming problem (LPP) solution method namely, Graphical method. By help of this
domination model we can get basic feasible solution of LPP and hence we are trying to minimize the
limitations of graphical method for solving LPP.
Bhatt, Tushar; Bhimani, G.(Kala : The Journal of Indian Art History Congress, 2021)
An Ad-hoc network is one that is spontaneously formed when device connect and communicate with each
other. It is mostly wireless local area network (WLANs). The devices communicate with each other directly
instead of ...
Vaidya, S.K.; Parmar, A.D.(Malaya Journal of Matematik, 2018)
A dominating set D of a graph G is called total if every vertex of V (G) is adjacent to at least one vertex of D, equivalently if N (D)= V (G) then D is called total dominating set. A dominating set D is called total ...
Vaidya, S. K.; Parmar, A. D.(Malaya Journal of Matematik, 2019)
A dominating set D of a graph G is called total if every vertex of V (G) is adjacent to at least one vertex of D,
equivalently if N(D) = V (G) then D is called total dominating set. A dominating set D is called total ...
