Research & Reviews: Discrete Mathematical Structures
Volume 5, Issue 3 (2018)
Published
Table of contents
-
Control Chart for Attributes based on Inverse Rayleigh Distribution
Abstract: In this paper, a new attribute control chart based on inverse Rayleigh distribution is developed under a time truncated life test. The number of failures is observed from the life test and the fraction nonconforming is to be monitored by two pairs of lower and upper control limits. The simulation study shows the efficiency of the developed chart. An example is provided for illustrating the new control chart.Cite this ArticleKowsalya …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 1–5 Read article
-
Degree and Distance in 2-cartesian Product of Graphs
Abstract: The cartesian product of two graphs is well-known graph product and studied in detail. This concept has been generalized by introducing 2-cartesian product of graphs. The connectedness of 2-cartesian product of graphs has been discussed earlier. In this paper, first we obtain degree formula and discuss regularity of this product of graphs. Also, we have discuss distance between two vertices in this product.Cite this ArticleH.S. Mehta and U.P. Acharya. Degree …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 11–14 Read article
-
Production Inventory Model for Deteriorating Products with Lifetime
Abstract: In this paper, an inventory model has been developed with production proportional to quadratic demand during life time and linear demand is taken during deterioration period. The deterioration rate is taken of power pattern form, i.e. 14 αβtβ-1"> . Shortage is not allowed.Cite this ArticleRajender Kumar, Manju Pruthi, Gulshan Taneja. Production Inventory Model for Deteriorating Products with Lifetime. Research & Reviews: Discrete Mathematical Structures. 2018; 5(3): 15–19p.
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 15–19 Read article
-
Solution of Solid Traveling Purchaser Problem Using Efficient Genetic Algorithm with Probabilistic Selection and Multi-Parent Crossover Technique
Abstract: In this paper, I design a NP-hard optimization problem and solve this problem by developing a nature-based multi-parent crossover in genetic algorithm (GA). Initially, taking a set of markets, a depot and some products for each of which a positive demand is specified. Purchaser can purchase each product from a subset of markets only a given quantity, less than or equal to the required one, can be purchased at a …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 20–26 Read article
-
Some Algebraic Properties of me-homomorphism of Semi graphs
Abstract: The theory of Semi graph was introduced by E. Sampat Kumar [6] which is analogous with theory of Hyper graph. Study of Homomorphism[4] is useful to prove numerous application of Graph theory, which is adjacency preserving mapping. In this Paper we have introduced me-homomorphism of Semi graphs and derived some of its algebraic properties [5]. We have also investigated nature of some parameters and its bounds under this mapping.Cite this …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 27–30 Read article
-
Use of Matlab in Teaching The Fundamentals of Probability
Abstract: The aim of this paper is to improve teaching efficiency with use of powerful educational software called 'MATLAB'. In this paper using the 'MATLAB' tool 'Makeshow' we attractively introduce normal probability distribution for the normally distributed random variables. Using these tool students can easily create interactive slideshows. Because of their rich library, available tools and demos matlab is easy to use for the students and so it provides option of …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 31–35 Read article
-
Characterization of topologically 1-uniform dcsl graphs and learning graphs
Abstract: A distance compatible set labeling (dcsl) of a connected graph $G$ is an injective set assignment $f : V(G) \rightarrow 2^{X},$ $X$ being a non empty ground set, such that the corresponding induced function $f^{\oplus} :E(G) \rightarrow 2^{X}\setminus \{\phi\}$ given by $f^{\oplus}(uv)= f(u)\oplus f(v)$ satisfies $ |f^{\oplus}(uv)| = k_{(u,v)}^{f}d_{G}(u,v) $ for every pair of distinct vertices $u, v \in V(G),$ where $d_{G}(u,v)$ denotes the path distance between $u$ and $v$ …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 3, 2018 · pp. 6–10 Read article