New generalization of the best proximity point problem

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Haddadi M.R.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Mahani Mathematical Research Year:2023 | Volume:12 | Issue:2 Page(s): 471-479

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

New generalization of the best proximity point problem

Author(s)

Haddadi M.R. | Issue Writer Certificate

Keywords

Common best proximity point‎

coincidence point‎

metric space‎

‎fixed‎ ‎point‎

Abstract

‎Let $(C,D)$ be a nonempty pair of disjoint subsets of a metric space. ‎Main purpose of this paper is to present a range of a convergence sequence to $u\in C\cup D$ such that $d(Tu,fu)=dist(C,D)$‎, for mappings $T,f:C\cup D\to C\cup D$. ‎In fact, ‎we give a generalization of best proximity point results for cyclic contractive mappings. ‎To this end‎, ‎we consider an example is presented to support the main result. ‎‎

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans