Category: Issue 3

ABSTRACT:

Ever since the notion of fuzzy set was introduced by Zadeh12 in 1965, the concept of fuzzy metric space was introduced by various authors in different directions. Especially, Deng1, Erceg2, Kaleva and Seikkala5, Karmosil and Michalek6 have introduced the concept of fuzzy metric space in different ways. George and Veeramani3 modified the concept of fuzzy metric spaces in the sense of Karmosil and Michalek6 and defined the Hausdorff topology of fuzzy metric spaces. Consequently they showed every metric induces a fuzzy metric. Mishra, Sharma and Singh9 also proved some fixed point theorems in fuzzy metric spaces. Sushil Sharma13 proved common fixed point theorems for six mappings. In this paper we define a generalized contractive condition for a self mapping with respect to another and establish the existence of coincidence point. Further we deduce a weak contractive condition for the existence of fixed point for single mapping. We begin with some definitions and preliminary concepts.

KEYWORDS: point theorems , Four R , Weakly Compatible

ABSTRACT:

The purpose of the paper is to study some of the properties of generalized ö-recurrent and generalized Concircular ¢ – recurrent Trans Sasakian manifolds and generalized projective ¢ -recurrent and generalize the some of the results1,2. Finally we studied the properties of 3- dimensional generalized ¢ recurrent trans-Sasakian manifold and some special cases13 are given in the text.

KEYWORDS: Trans Sasakian Manifolds, generalized u00f6-recurrent and generalized Concircular, Recurrent Trans Sasakian Manifold, Einstein Manifold.

ABSTRACT:

Let G= (V, E) be a graph.Then the semitotal-point graph is denoted byT2 (G) = H. Let the vertices and edges of G be the elements of G A dominating set D of a graph H is a maximal dominating set of H if V (H) – D is not a dominating set of H. The maximal semitotal-point (MSP) domination number Y mtp (G) of G is the minimum cardinality of a MSP dominating set of H. In this paper many bounds on Y mtp (G) are obtained in terms of elements of G but not the elements of H. Also its relationship with other domination parameters are investigated.

KEYWORDS: domination number, maximal domination number, maximal semitotal-point domination number

ABSTRACT:

In this paper, a new method of analysis for the stiff systems of higher order using the single-term Haar wavelet series (STHW) is presented. To illustrate the effectiveness of the STHW, A problem have been considered and compared with the single-term Walsh Series (STWS) method, and with the exact solutions of the problem, and are found to be very accurate. Error graphs for the stiff systems of higher order are presented in a graphical form to show the efficiency of this STHW method. This STHW method can be easily implemented in a digital computer and the solution can be obtained for any length of time.

KEYWORDS: Single-term Walsh series (STWS) method, Ordinary differential equations, Stiff differential equations and Stiff systems of higher dimension.

ABSTRACT:

In this paper, necessary condition for admissibility of a conditionally specified test procedure for testing main effects in analysis of variance of a random model with four- stage unbalanced nested design has been derived.

KEYWORDS: Admissibility, preliminary test of significance, conditionally specified test, our-stage unbalanced design, random model

ABSTRACT:

A simple graph G is a graceful graph if there exists a graceful labeling of the vertices of G. A graph G with e edges has a graceful labeling if there exists an injective function ʎ: V (G) →{0, 1, …, e} such that ʎ (x) – ʎ​​​​​​​ (y)| is distinct and nonzero for all xy € E (G). If we cannot gracefully label the vertices of G, then G is a non-graceful graph. Graceful labeling is one of the best known labeling methods of graphs. In this work, I will try to give some of the Algorithms of graceful labeling in Harmonius labeling

KEYWORDS: graceful labeling, graceful graph, Harmonius labeling

ABSTRACT:

This paper introduces an algorithm for optimal boundary extraction based on representing edge segments in the form of a graph. This algorithm proposes a method for finding the shortest path, based on Critical path method, which is nothing but the optimal boundary. A program has been developed for finding the shortest path. The effectiveness of the algorithm is illustrated by means of an example and some concluding remarks are provided at the last.

KEYWORDS: Optimal Boundary Extraction, Edge Detection, Dynamic Programming, Search Algorithms, Shortest Path

ABSTRACT:

In this article, we introduce ST decomposition procedure to solve fully fuzzy linear systems. This paper mainly to discuss a decomposition of a non singular fuzzy matrix, symmetric times triangular (ST) decom-position. To solve, every non singular fuzzy matrix can be represented as a product of fuzzy symmetric matrix S and fuzzy triangular matrix T in the form of triangular fuzzy number matrices. By this method, we obtain the solution of fully fuzzy linear system of equations, particularly in the case of triangular fuzzy number matrices.

KEYWORDS: Symmetric and Triangular Decomposition, Triangular fuzzy number matrices.

ABSTRACT:

In the model considered in this paper, a source generated fixed charge transportation problem with nonlinear cost function. The objective of the transportation problem includes the nonlinear variable cost function and a fixed charge. The Kuhn-Tucker conditions to the nonlinear transportation model are used to derive optimal conditions for the problem. An algorithm is developed for reaching an optimal solution. This is illustrated with the help of a numerical example.

KEYWORDS: lgorithm , fixed charge , nonlinear transportation