loading

Category: Issue 3

Solving multi objective fuzzy fractional programming problem

1P. DURGA PRASAD DASH and 2RAJANI B. DASH
1Shishu Ananta Mahavidyalaya Balipatna, Khurda Odisha India

2S.C.S(A) College Puri Odisha India

Email:-pdp.dash@gmail.com Email:-rajani_bdash@rediffmail.com

ABSTRACT:

A method of solving multi objective fuzzy fractional programming problem (MOFFPP) is presented. All the coefficients of
the fractional multi objective functions and the constraints are taken to be fuzzy numbers. A numerical example is presented.

KEYWORDS: Multi objective fractional programming problem, multi objective fuzzy fractional programming problem, Fuzzy fractional programming, linear ranking function, trapezoidal fuzzy numbers, optimal solution, Crisp LPP. 2010 AMS Classification “90C05, 90C70”


A method of solving multi objective fuzzy fractional programming problem (MOFFPP) is presented. All the coefficients of the fractional multi objective functions and the constraints are taken to be fuzzy numbers....

The fuzzified concepts of several ideals of semi groups

*Md. ARSHADUZZAMAN and **R.K. DAS
*Mumtaz Mohalla, Naugachia- Bhagalpur Bihar India

**Post Graduate Department of Mathematics S.K.M University Dumka India

Email:-shayan.zaman@gmail.com

ABSTRACT:

The paper is addressed to the introduction of fuzzified ceoncepts of some ideals of semi group developed by Atanassov (1980). Some properties of such ideals have also been investigated

KEYWORDS: ntutionistic fuzzy (Atanassov), Ideal, Intutionistic fuzzy bi-ideal.


The paper is addressed to the introduction of fuzzified ceoncepts of some ideals of semi group developed by Atanassov (1980). Some properties of such ideals have also been investigated

On Felicitous Labelings of Hn and Hn  Sm graphs

V. LAKSHMI ALIAS GOMATHI, A. NAGARAJAN and A. NELLAI MURUGAN
V.O.C College Tuticorin

ABSTRACT:

A simple graph G is called felicitous if there exists a 1 – 1 function f : V(G)  {0,1,2, . . . , q} such that the set of induced edge labels f *(uv) = (f(u) + f(v)) (mod q) are all distinct. In this paper, Hn and Hn  Sm graphs are shown to be felicitous.

KEYWORDS: Graph Labeling, Hn and Hn  Sm, felicitous labeling


A simple graph G is called felicitous if there exists a 1 – 1 function f : V(G)  {0,1,2, . . . , q} such that the set of...

Roman lict domination in graphs

M. H. MUDDEBIHAL and SUMANGALADEVI

Department of Studies and Research in Mathematics Gulbarga University Gulbarga India

ABSTRACT:

The lict graph n(G) of a graph G is the graph whose vertex set is the union of the set of edges and the set of cut vertices of G in which two vertices are adjacent if and only if the corresponding edges of G are adjacent or the corresponding members of G are incident. A Roman dominating function on a lict graph n(G)  (V ‘,E ‘) is a function f :V ‘0,1, 2 satisfying the condition that every vertex u’ for which f (u’)=0 is adjacent to at least one vertex v’ for which f (v’)=2. The weight of a Roman dominating function is the value’ ‘ ( ‘) ( ‘) u Vf V f u

The minimum weight of a Roman dominating function on a lict graph n(G) is called the Roman lict domination number
of G and is denoted by   Rn  G . In this paper we study the graph theoretic properties of   Rn  G and its exact values for some standard graphs and expressed in terms of members of G but not the members of n(G). Also we establish the some relations with other domination parameters.

KEYWORDS: Lict graph/ Dominating set/ Roman dominating set/ Roman domination number. Subject Classification number: AMS-05C69, 05C70


The lict graph n(G) of a graph G is the graph whose vertex set is the union of the set of edges and the set of cut vertices of...

Connected lict domination in graphs

M.H. MUDDEBIHAL and KALSHETTI. SWATI. M.
Department of Studies and Research in Mathematics Gulbarga University Gulbarga India

Email:- mhmuddebihal@yahoo.co.in Email:- swati.kalshetti@gmail.com

ABSTRACT:

For any graphG , the lict graph nG  J of a graph G is the graph whose vertex set is the union of the set of edges and set of cut vertices of G in which two vertices are adjacent if and only if corresponding members are adjacent or incident. A dominating set D is called connected dominating set of nG , if D is also connected, the minimum cardinality of D is called connected domination number of nG and is denoted by   nc  G . In this paper, many bounds on  nc  G were obtained in terms of vertices, edges and other different parameters of G but not in terms of elements of J .Further we develop its relation with other different domination parameters.

KEYWORDS: Key words: Lict Graph / Dominating set / Connected domination/ Total domination. Subject classification number: AMS-O5C69, 05C70.


For any graphG , the lict graph nG  J of a graph G is the graph whose vertex set is the union of the set of edges and set...

A new algorithmic approach on multi-objective fuzzy transshipment problem

A. NAGOOR GANI1, R. BASKARAN2 and S.N. MOHAMED ASSARUDEEN3
1,3PG & Research Department of Mathematics, Jamal Mohamed College Tiruchirappalli India

2Department of Mathematics, Government Arts College,Melur Madurai India

Email:- ganijmc@yahoo.co.in

ABSTRACT:

In this paper, Multi-objective Transportation Problem in fuzzy environment is extended to Multi-objective transshipment problem. A new fuzzy blocking algorithm and fuzzy blocking zero point algorithm are used to obtain an optimal fuzzy time and optimal fuzzy cost of the Multi-objective fuzzy transshipment problem. These algorithms are useful to multi-objective nature of fuzzy transshipment problem

KEYWORDS: Fuzzy Transportation problem, Fuzzy time Transshipment problem, Multi-objective Fuzzy Transshipment problem Subject Classification: 03E72.


In this paper, Multi-objective Transportation Problem in fuzzy environment is extended to Multi-objective transshipment problem. A new fuzzy blocking algorithm and fuzzy blocking zero point algorithm are used to obtain an optimal...

The double-ended queue with social and economic situations

1RAM KHILAWAN TIWARI and 2DHARMENDRA BADAL
1Department of Mathematics G.B.S College Mauranipur India

2Department of Mathematical Sciences and Computer Applications Bundelkhand University Jhansi UP India

ABSTRACT:

The double-ended queue involving trains and passangers at a Railway station has been considered under the assumption that there is limited waiting space both for trains and for passangers. The arrival distribution of trains is simulated by means of an arrival timing channel consisting of j phases. The arrivals of passangers are assumed to be Poisson distributed. In the time dependent case we obtain an expression for the Laplace transform of the probabilities that there are n units in the queue. The cases of exponential and 2-Erlang arrival distributions for trains have been considered as particular cases. In the steady state, for a 2-Erlang arrival distribution for trains, we have evaluated the probabilities that the waiting space for passangers or trains is full in different particular cases. Their values are also shown by means of graphs.

KEYWORDS: Double ended queue, limited waiting space, socialsituations.


The double-ended queue involving trains and passangers at a Railway station has been considered under the assumption that there is limited waiting space both for trains and for passangers. The arrival distribution...

Another Form of Weakly Closed Sets

*M. LELLIS THIVAGAR and ** C. SANTHINI
*School of Mathematics, Madurai Kamraj University, Madurai Tamil Nadu India

**Department of Mathematics V.V Vanniaperumal College for Women Virudhunagar Tamil Nadu India

Email:-mlthivagar@yahoo.co.in

ABSTRACT:

In this paper, we introduce the notions of a-sets and aclosed sets using a-open sets and a-closed sets. We also investigate several characterizations and properties of a-continuous functions,a-compact spaces and a-connected spaces.

KEYWORDS: a-closed sets, a-sets and a-closed sets. 2010 AMS Subject Classification: 54 C05


In this paper, we introduce the notions of a-sets and aclosed sets using a-open sets and a-closed sets. We also investigate several characterizations and properties of a-continuous functions,a-compact spaces and a-connected...

Approximation of conjugate series of a fourier series by product summability

MAHENDRA MISRA1 , B.P. PADHY2, N.K. PANDA3 and U.K.MISRA4
1PG Department of Mathematics N.C College Autonomous jajpur Odisha India

2Roland Institute of Technology Golanthara Odisha India

3Aeronautics College Sunabedha Odisha India

Email:-mahendramisra2007@gmail.com

ABSTRACT:

In this paper a theorem on degree of approximation by product summability  ,  ,  n E q N p of the conjugate series of the Fourier series of the function f of class Lip t , r.
Key words: Degree of Approximation, Lip  , r  class of function, Lip  t , r  class of function, E, q- mean,  ,  n N p – mean,  ,  , n  E q N p -mean, Fourier series, conjugate of the Fourier series, Lebesgue integral.

KEYWORDS: 2010-Mathematics subject classification: 42B05, 42B08


In this paper a theorem on degree of approximation by product summability  ,  ,  n E q N p of the conjugate series of the Fourier series of...

Properties of Onto Functionally Open Equal Closed Spaces

CHARLES DORSETT
Texax A&M university -Commerce USA

ABSTRACT:

Within this paper properties of topological spaces for which open, onto functions and closed, onto functions are equivalent are investigated and the results are used to further characterize such spaces.

KEYWORDS: onto, open functions, onto, closed functions. AMS Subject Classification: 54A05, 54C10, 54D10, 54D15.


Within this paper properties of topological spaces for which open, onto functions and closed, onto functions are equivalent are investigated and the results are used to further characterize such spaces.