• No results found

A Fixed Point Theorems for Soft Contractive Mapping by Using Altering Distance Function

N/A
N/A
Protected

Academic year: 2020

Share "A Fixed Point Theorems for Soft Contractive Mapping by Using Altering Distance Function"

Copied!
14
0
0

Loading.... (view fulltext now)

Full text

(1)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

436

A Fixed Point Theorems for Soft Contractive Mapping by Using

Altering Distance Function

Mahesh Tiwari1, Ramakant Bhardwaj 2, Basant Kumar Singh3, Sunil Garge4

1,3Department Of Mathematics, RNT University, Bhopal (M.P.) 2Technocrats Institute of Technology , Bhopal, M.P., India

4Senier Scintific Officer, MPCST Bhopal

ABSTRACT

In the present paper, we prove some fixed point theorem in complete soft metric spaces by using altering distance function.

Keywords: - Soft metric space, soft contractive mapping, fixed point, altering distance function.

Mathematics Subject Classification: - 47H10, 54H25.

1. INTRODUCTION &PRELIMINARIES

A new category of contractive fixed point problem was introduced by M. S. Khan, M. Swalech and S. Sessa [9]. In this work, they introduced the concept of altering distance function which is a control function that alters distance between two points in a metric space.

In the year 1999, Molodtsov [13] initiated a novel concept of soft sets theory as a new mathematical tool for dealing with uncertainties. A soft set is a collection of approximate descriptions of an object. Soft systems provide a very general framework with the involvement of parameters. Since soft set theory has a rich potential, applications of soft set theory in other disciplines and real life problems are progressing rapidly.

Maji et al. [10,11] worked on soft set theory and presented an application of soft sets in decision making problems. Chen [3] introduced a new definition of soft set parameterization reduction and a comparison of it with attribute reduction in rough set theory. Many researchers contributed towards many structure on soft set theory. [1, 3].

M. Shabir and M. Naz [14] presented soft topological spaces and they investigated some properties of soft topological spaces. Later, many researches about soft topological spaces were studied in [2,6,7,12,14]. In these studies, the concept of soft point is expressed by different approaches. In the study we use the concept of soft point which was given in [2,4].

Definition 2.1: Let be an initial universe set and be a set of parameters. A pair is called a soft set over if and only if is a mapping from into the set of all subsets of the set where is the power set of

(2)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

437

Definition 2.3: The union of two soft sets and over is the soft set where and

{

This relationship is denoted by

Definition 2.4: The soft set over is said to be a null soft set denoted by if for all

Definition 2.5: A soft set over is said to be an absolute soft set, if for all

Definition 2.6: The difference of two soft sets and over denoted by , is defined as for all

Definition 2.7: The complement of a soft set is denoted by and is defined by where is mapping given by

Definition 2.8: Let be the set of real numbers and be the collection of all nonempty bounded subsets of and taken as a set of parameters. Then a mapping is called a soft real set. It is denoted by If specifically is a singleton soft set, then identifying with the corresponding soft element, it will be called a soft real number and denoted ̃ ̃ ̃ etc.

are the soft real numbers where for all respectively.

Definition 2.9: For two soft real numbers

(i) ̃ ̃ if ̃ ̃ for all

(ii) ̃ ̃ if ̃ ̃ for all

(iii) ̃ ̃ if ̃ ̃ for all

(3)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

438

Definition 2.10: A soft set over X is said to be a soft point if there is exactly one such that for some and It will be denoted by ̃

Definition 2.11: Two soft points ̃ ̃ are said to be equal if and i.e. Thus ̃ ̃ or

Definition 2.12: A mapping ̃ ( ̃) ( ̃) is said to be a soft metric on the soft set ̃ if satisfies the following conditions:

(M1) ̃( ̃ ̃ ) ̃ for all ̃ ̃ ̃ ̃

(M2) ̃( ̃ ̃ ) if and only if ̃ ̃

(M3) ̃( ̃ ̃ ) ̃ ̃( ̃ ̃ ) for all ̃ ̃ ̃ ̃

(M4) ̃( ̃ ̃ ) ̃ ̃( ̃ ̃ ) ̃( ̃ ̃ ) for all ̃ ̃ ̃ ̃ ̃

The soft set ̃ with a soft metric ̃ on ̃ is called a soft metric space and denoted by ( ̃ ̃ )

Definition 2.13 (Cauchy Sequence): A sequence { ̃ } of soft points in ( ̃ ̃ ) is considered as a Cauchy sequence in ̃ if corresponding to every ̃ ̃ such that ( ̃ ̃ ) ̃ ̃ i.e. ( ̃ ̃ ) as

Definition 2.14 (Soft Complete Metric Space): A soft metric space ( ̃ ̃ )is called complete,

if every Cauchy Sequence in ̃ converges to some point of ̃

Definition 2.15: Let( ̃ ̃ )be a soft metric space. A function ( ̃ ̃ ) ( ̃ ̃ )is called a soft contractive mapping if there exist a soft real number such that for every point ̃ ̃ we have

̃ ( ̃ ( ̃ )) ̃( ̃ ̃ )

Definition 2.16[9]: The function is called an altering distance function if the following properties are satisfied:

(4)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

439

3.MAIN RESULTS

Theorem 3.1: Let ( ̃ ̃ ) be a soft complete metric space. Suppose the soft mapping

( ̃ ̃ ) ( ̃ ̃ )satisfies the soft contractive condition:

* ̃ ( ̃ ( ̃ ))+ [ ̃ ( ̃ ̃ )] [ ̃ ( ̃ ̃ )] (3.1.1)

For each ̃ ̃ ̃ ̃ ̃ where are altering distance functions, and

Where ̃ ( ̃ ̃ ) { ̃ ( ̃ ̃ ) ̃ ( ̃ ( ̃ ))

̃ ( ̃ ̃ ) ̃ ( ̃ ( ̃ ))}

{ ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ )

̃( ̃ ( ̃ )) ̃( ̃ ̃ )} { ̃( ̃ ̃ )} (3.1.2)

Where and is a soft constant. Then has a unique fixed point in ̃

Proof: Let ̃ be any soft point in

Set ̃ ( ̃ ) ( ( ̃ ))

̃ ( ̃ ) ( ( ̃ ))

̃ ( ̃ ) ( ( ̃ ))

Now consider, from (3.1.2) we have

̃ ( ̃ ̃ ) { ̃ ( ̃ ( ̃

)) ̃ ( ̃

( ̃ ))

̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))}

{ ̃ ( ̃ ( ̃

)) ̃ ( ̃ ( ̃ ))

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ ))} { ̃( ̃

̃ )}

{ ̃ ( ̃ ̃

) ̃ ( ̃ ̃ )

(5)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

440

{ ̃ ( ̃ ̃

) ̃ ( ̃ ̃ )

̃( ̃ ̃ ) ̃( ̃ ̃ )} { ̃( ̃

̃ )}

{( ̃( ̃ ̃

) ̃( ̃ ̃ )) ( ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ))

̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) }

{ ̃ ( ̃ ̃

)

̃ ̃ ̃ } { ̃( ̃

̃ )}

{ ̃( ̃ ̃ ) ̃( ̃ ̃ )} { ̃( ̃ ̃ )} { ̃( ̃ ̃ )}

̃( ̃ ̃ ) ̃( ̃ ̃ )

From (3.1.1) we have

[ ̃( ̃ ̃ )] * ̃ ( ( ̃ ) ( ̃ ))+

[ ̃ ( ̃ ̃ )] [ ̃ ( ̃ ̃ )]

[ ̃( ̃ ̃ ) ̃( ̃ ̃ )] [ ̃ ( ̃ ̃ )]

[ ̃( ̃ ̃ )] [ ̃( ̃ ̃ ) ̃( ̃ ̃ )]

Since is non-decreasing, we have

̃( ̃ ̃ ) ̃( ̃ ̃ ) ̃( ̃ ̃ )

̃( ̃ ̃ )

̃( ̃

̃ )

̃( ̃ ̃ ) ̃( ̃ ̃ ) Where

Thus ̃( ̃ ̃ ) ̃( ̃ ̃ )

Taking we have

̃( ̃ ̃

(6)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

441

Now, we will show that { ̃ }is a soft Cauchy sequence. Suppose that { ̃ } is not a Soft

Cauchy sequence, which means that there is a constant such that for each positive integer k, there are positive integer and with such that

̃ ( ̃ ̃ ) ̃ ( ̃ ̃ )

By triangle inequality

̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ )

Letting and using (3.1.3), we have

̃ ( ̃ ̃

) …(3.1.4)

Similarly, we have

̃ (

̃

̃

)

̃ (

̃

̃

)

̃ (

̃

̃

)

}

…(3.1.5)

Putting ̃ ̃

and ̃ ̃

in (3.1.2) we have

(7)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

442

{

̃ ( ̃

̃

) ̃ ( ̃

̃

) ̃( ̃

̃

) ̃( ̃

̃

)} , ̃ ( ̃

̃

)-Letting and using (3.1.3),(3.1.4) and (3.1.5), we have

̃ ( ̃

̃

) …(3.1.6)

From (3.1.1) we have

* ̃ ( ̃

̃

)+ * ̃ ( ( ̃

) ( ̃

))+

* ̃ ( ̃

̃

)+ * ̃ ( ̃

̃

)+

Taking using (3.1.5), (3.1.6) and the continuity of and ,we have

] ] ]

] ]

This leads to ] , and property of we get .

This is a contradiction. Thus{ ̃ }is a soft Cauchy sequence in ̃, which is complete. Thus,

there is ̃ ̃such that ̃ ̃ … (3.1.6)

Putting ̃ ̃ and ̃ ̃ in (3.1.2) we have

̃ ( ̃ ̃ ) { ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))

̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))}

{ ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ ))} { ̃( ̃ ̃ )}

Taking and using (3.1.3) and (3.1.6) we have

̃ ( ̃ ̃ ) { ̃( ̃ ̃ )}

From (3.1.1) we have

(8)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

443

[ ̃ ( ̃ ̃ )] [ ̃ ( ̃ ̃ )]

[ ̃( ̃ ̃ )] [ { ̃( ̃ ̃ )}] [ { ̃( ̃ ̃ )}]

[ ̃( ̃ ̃ )] [ ̃( ̃ ̃ )] [ { ̃( ̃ ̃ )}]

Which implies [ { ̃( ̃ ̃ )}]

So ̃( ̃ ̃ ) that is ̃ ̃

Uniqueness: Let ̃ is another fixed point of in ̃such that ̃ ̃ , then we have

Putting ̃ ̃ and ̃ ̃ in (3.1.2) we have

̃ ̃ ̃ { ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))

̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))}

{ ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ ))} { ̃ ̃ ̃ }

̃ ̃ ̃ ̃ ̃ ̃

From (3.1.1) we have

[ ̃ ̃ ̃ ] [ ̃( ̃ ̃ )]

[ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ]

[ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ]

[ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ]

So [ ̃ ̃ ̃ ] thus ̃ ̃ ̃ that is ̃ ̃

Hence fixed point of is unique.

Corollary 3.2: Let ( ̃ ̃ ) be a soft complete metric space. Suppose the soft mapping

( ̃ ̃ ) ( ̃ ̃ )satisfies the following condition:

* ̃ ( ̃ ( ̃ ))+ [ ̃ ( ̃ ̃ )] [ ̃ ( ̃ ̃ )] (3.2.1)

(9)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

444

Where ̃ ( ̃ ̃ ) { ̃ ( ̃ ̃ ) ̃ ( ̃ ( ̃ ))

̃ ( ̃ ̃ ) ̃ ( ̃ ( ̃ ))}

{ ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ )

̃( ̃ ( ̃ )) ̃( ̃ ̃ )} { ̃( ̃ ̃ )}

, ̃( ̃ ̃ ) ̃ ( ̃ ( ̃

, ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ )- (3.2.2)

Where and is a soft constant. Then has a unique fixed point in ̃

Proof: It can be proved easily.

Theorem 3.3: Let ( ̃ ̃ ) be a soft complete metric space. Suppose the soft mapping

( ̃ ̃ ) ( ̃ ̃ )satisfies the following condition:

* ̃ ( ̃ ( ̃ ))+ [ ̃ ( ̃ ̃ )] [ ̃ ( ̃ ̃ )](3.3.1)

For each ̃ ̃ ̃ ̃ ̃ where are altering distance functions, and

Where ̃ ( ̃ ̃ ) { ̃ ( ̃ ̃ ) ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ )

̃( ̃ ̃ ) ̃( ̃ ( ̃ )) ̃( ̃ ̃ ) }

{ ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ )

̃( ̃ ( ̃ )) ̃( ̃ ̃ ) ̃( ̃ ̃ ) } (3.3.2)

Where and is a soft constant. Then has a unique fixed point in ̃

Proof: Let ̃ be any soft point in

Set ̃ ( ̃ ) ( ( ̃ ))

̃ ( ̃ ) ( ( ̃ ))

̃ ( ̃ ) ( ( ̃ ))

(10)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

445

Now consider from(3.3.1) we have

̃ ( ̃ ̃ ) { ̃ ( ̃ ( ̃

)) ̃ ( ̃

( ̃ )) ̃ ( ̃ ( ̃ ))

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) }

{ ̃ ( ̃ ( ̃

)) ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ )

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) ̃( ̃ ̃ ) }

{ ̃ ( ̃ ̃

) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ )

̃( ̃ ̃ ) ̃( ̃ ̃ ) ̃( ̃ ̃ ) }

{ ̃ ( ̃ ̃

) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ )

̃( ̃ ̃ ) ̃( ̃ ̃ ) ̃( ̃ ̃ ) }

{( ̃( ̃ ̃

) ̃( ̃ ̃ ))

̃( ̃ ̃ ) ̃( ̃ ̃ ) } {

( ̃( ̃ ̃ ) ̃( ̃ ̃ )) ̃( ̃ ̃ ) ̃( ̃ ̃ ) }

{ ̃( ̃ ̃ ) ̃( ̃ ̃ )} { ̃( ̃ ̃ ) ̃( ̃ ̃ ) }

{ ̃( ̃ ̃ )} { ̃( ̃ ̃ ) }

From (3.3.1), we have

[ ̃( ̃ ̃ )] * ̃ ( ( ̃ ) ( ̃ ))+

[ ̃ ( ̃ ̃ )] [ ̃ ( ̃ ̃ )]

[ { ̃( ̃ ̃ )} { ̃( ̃ ̃ ) }] [ ̃ ( ̃ ̃ )]

[ ̃ ( ̃ ̃ )]

[ ̃( ̃ ̃ )] [ { ̃( ̃ ̃ )} { ̃( ̃ ̃ ) }]

Since is non-decreasing, we have

̃( ̃ ̃ ) { ̃( ̃ ̃ )} { ̃( ̃ ̃ ) }

̃( ̃ ̃ )

̃( ̃

̃ )

(11)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

446

̃( ̃ ̃ ) ̃( ̃ ̃ ) Where

Thus ̃( ̃ ̃ ) ̃( ̃ ̃ )

Taking we have

̃( ̃ ̃

) …(3.3.3)

Now, we will show that { ̃ }is a soft Cauchy sequence. Suppose that { ̃ } is not a Soft

Cauchy sequence, which means that there is a constant such that for each positive integer k, there are positive integer and with such that

̃ ( ̃ ̃ ) ̃ ( ̃ ̃ )

By triangle inequality

̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ )

Letting and using (3.3.3), we have

̃ ( ̃ ̃

) …(3.3.4)

Similarly, we have

̃ (

̃

̃

)

̃ (

̃

̃

)

̃ (

̃

̃

)

}

…(3.3.5)

Putting ̃ ̃

and ̃ ̃

in (3.3.2) we have

(12)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

447 { ̃ . ̃ ( ̃ )/ ̃ . ̃ ( ̃ )/ ̃ ( ̃ ̃ ) ̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) ̃( ̃ ̃ ) } { ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃( ̃ ̃ ) ̃( ̃ ̃ ) ̃( ̃ ̃ ) } { ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃ ( ̃ ̃ ) ̃( ̃ ̃ ) ̃( ̃ ̃ ) ̃( ̃ ̃ ) }

Letting and using (3.3.3) and (3.3.5), we have

̃ ( ̃ ̃

) …(3.3.6)

From (3.3.1) we have

* ̃ ( ̃ ̃ )+ * ̃ ( ( ̃ ) ( ̃ ))+ * ̃ ( ̃ ̃ )+ * ̃ ( ̃ ̃ )+

Taking and from (3.3.5), (3.3.6), we have

] ] ]

] ]

This leads to ] , and property of we get .

This is a contradiction. Thus{ ̃ }is a soft Cauchy sequence, which is complete. Thus, there is ̃ ̃such that ̃ ̃ … (3.3.7)

Putting ̃ ̃ and ̃ ̃ in (3.3.2) we have

̃ ( ̃ ̃ ) { ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) }

{ ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ )

(13)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

448

Taking and using (3.3.3), (3.3.7) we have

̃ ( ̃ ̃ ) { ̃( ̃ ̃ )}

From (3.3.1) we have

* ̃ ( ̃ ̃ )+ * ̃ ( ( ̃ ) ̃ )+

[ ̃ ( ̃ ̃ )] [ ̃( ̃ ̃ )]

[ ̃( ̃ ̃ )] [ { ̃( ̃ ̃ )}] [ { ̃( ̃ ̃ )}]

[ ̃( ̃ ̃ )] [ ̃( ̃ ̃ )] [ { ̃( ̃ ̃ )}]

Which implies [ { ̃( ̃ ̃ )}]

So ̃( ̃ ̃ ) that is ̃ ̃

Uniqueness: Let ̃ is another fixed point of in ̃such that ̃ ̃ , then we have

Putting ̃ ̃ and ̃ ̃ in (3.3.2) we have

̃ ̃ ̃ { ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ ))

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) }

{ ̃ ( ̃ ( ̃ )) ̃ ( ̃ ( ̃ )) ̃ ( ̃ ̃ )

̃( ̃ ( ̃ )) ̃( ̃ ( ̃ )) ̃( ̃ ̃ ) }

̃ ̃ ̃ { ̃ ̃ ̃ }

From (3.3.1) we have

[ ̃ ̃ ̃ ] [ ̃( ̃ ̃ )]

[ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ]

[ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ]

[ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ] [ ̃ ̃ ̃ ]

(14)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

449

Hence fixed point of is unique.

References

1. Ali, M. I., Feng, F., Liu, X., Min, W. K., and Shabir, M., “On some new operations in soft set theory”, Comput. Math. Appl. 49(2005) 1547-1553.

2. Bayramov, S., Gunduz(Aras) C., “Soft locally compact and soft paracompact spaces”, Journal of Mathematics and System Science (accepted).

3. Chen, D., “The parameterization reduction of soft sets and its applications”, Comput. Math. Appl. 49 (2005) 757-763.

4. Das, S., and Samanta, S. K., “Soft metric”, Annals of Fuzzy Mathematics and Informatics, 6(1) (2013) 77-94.

5. Das, S., and Samanta, S. K., “On soft metric spaces”, J. Fuzzy Math, accepted.

6. Gunduz, C.,(Aras), Sonmez, A., Çakallı, H., “On Soft Mappings”, arXiv:1305.4545v1 [math.GM], 16 May 2013.

7. Hussain, S. and Ahmad, B., “Some properties of soft topological spaces”, Computers and Math. with Applications, 62(2011), 4058-4067.

8. Jain, S., Bhardwaj, R., “ Some fixed point theorems for new rational expansion in complete metric space”, South Asian Journal of mathematics, (2012) vol. 2(4), 46-49. 9. Khan, M. S., Swalech, M. and Sessa, S., “Fixed point theorms by altering distance

between the points”, Bull. Austral Math. Soc., 30 (1984) 1-9.

10.Maji, P. K., Roy, A. R., Biswas, R., “An application of soft sets in a decision making problem”, Comput. Math. Appl.44 (2002) 1077-1083.

11.Maji, P. K., Roy, A. R., Biswas, R., “Soft set theory”, Comput. Math. Appl.45 (2003) 555-562.

12.Majumdar, P., and Samanta, S. K., “On soft mappings”, Comput. Math. Appl. 60 (2010) 2666-2672.

13.Molodtsov, D., “Soft set-theory-first results”, Comput. Math. Appl. 37(1999) 19-31. (11) 14.Shabir, M., and Naz, M., “On soft topological spaces”, Comput. Math. Appl. 61(2011)

1786-1799.

References

Related documents

From the frequency and percentage analysis, demographic information and personal life factors, support from family, workplace problem arising, workplace

Differences in 1 H-MRS profiles of urine between healthy pregnant and non-pregnant women reflect alterations of specific structures of the kidney accompanying pregnancy.. In

of miornlal infants and! children. : Electro- phoretic analysis of serum proteins in imifants amid! children. Normal values fromn birth to adolescence. : The half-life of

Although rifaximin has been proposed as first line treatment for small intestinal bacterial overgrowth (SIBO), few data are available regarding its efficacy in non-IBS subjects..

Methods: the efficacy of fixed co-formulated (f) artesunate-sulfamethoxypyrazine-pyrimethamine (AS+SMP f) administered at time intervals of 12 hours for a 24-hour therapy was

This review was undertaken to summarize the patterns and trends of resistance to commonly used antibiotics among common bacterial isolates from humans and ani- mals from 1990s to