01. Journal Articles Collection home page

Collection of Journal Articles of Faculties in Mathematics Department

Browse
Subscribe to this collection to receive daily e-mail notification of new additions RSS Feed RSS Feed RSS Feed
Collection's Items (Sorted by Submit Date in Descending order): 1 to 20 of 35
Issue DateTitleAuthor(s)
2018-12Shortest distance between two vertices in connected graph using TJ – adjacency of vertices and minimum dominating setBhatt, Tushar; Zalavadiya, Jayesh; Teraiya, Om
2021Perfect domination number of path graph Pn and its Corona product with another path graph Pn−1Bhatt, Tushar; Bhimani, G.
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.
2020-05Application of Domination Theory in Operation Research: The Domination Model of Graphical Method for solving LPP with two variablesBhatt, Tushar; Bhimani, G.
2020-04Domination Model of Graphical Method for Solving LPPBhatt, Tushar; Bhimani, G.
2019-06Edge domination number of Jump Graph : A comparative StudyBhatt, Tushar; Bhimani, G.
2014Product Cordial Labeling for some Bistar related GraphsVaidya, S.; Vyas, N.
2014Product cordial labeling for alternate snake graphsVaidya, S.; Vyas, N.
2013-12Some More Results on Even Mean LabelingVaidya, S.; vyas, N.
2013-08Even Mean Labeling for Path and Bistar related GraphsVaidya, S.; Vyas, N.
2013Antimagic Labeling of Some Path and Cycle Related GraphsVaidya, S.; Vyas, N.
2012Some Results on E-cordial LabelingVaid, S.; Vyas, N.
2012E-Cordial Labeling in the Context of Switching of a VertexVaidya, S.; Vyas, N.
2012Antimagic Labeling in the Context of Switching of a VertexVaidya, S.; Vyas, N.
2011E-Cordial Labeling of Some Mirror GraphsVaidya, S.; Vyas, N.
2011-11E-Cordial Labeling for Cartesian Product of Some GraphsVaidya, S.; Vyas, N.
2011-08Product Cordial Labeling in the Context of Tensor Product of GraphsVaidya, S.; Vyas, N.
2021Restrained edge domination number of some path related graphsVaidya, S.K.; Ajani, P.D.
2020Equitable restrained domination number of some graphsVaidya, S.K.; Ajani, P.D.
2020On restrained edge dominating set of graphsVaidya, S.K.; Ajani, P.D.
Collection's Items (Sorted by Submit Date in Descending order): 1 to 20 of 35