Search


Start a new search
Add filters:

Use filters to refine the search results.


Results 411-420 of 1834 (Search time: 0.0 seconds).
Item hits:
Issue DateTitleAuthor(s)
2012E-Cordial Labeling in the Context of Switching of a VertexVaidya, S.; Vyas, N.
2013Antimagic Labeling of Some Path and Cycle Related GraphsVaidya, S.; Vyas, N.
2014Product Cordial Labeling for some Bistar related GraphsVaidya, S.; Vyas, N.
2014Product cordial labeling for alternate snake graphsVaidya, S.; Vyas, N.
2013-08Even Mean Labeling for Path and Bistar related GraphsVaidya, S.; Vyas, N.
2021In 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.
2018-12Shortest distance between two vertices in connected graph using TJ – adjacency of vertices and minimum dominating setBhatt, Tushar; Zalavadiya, Jayesh; Teraiya, Om
2020-05Application of Domination Theory in Operation Research: The Domination Model of Graphical Method for solving LPP with two variablesBhatt, Tushar; Bhimani, G.
2014Analysis and Optimization of 270° Jib Crane Deflection: A ReviewVakani, Chirag; Jani, Shivang
2021Perfect domination number of path graph Pn and its Corona product with another path graph Pn−1Bhatt, Tushar; Bhimani, G.

Discover