Fixed Point Theorems for Non-self Mappings Using Disconnected Graphs

R. O. Gayathri, R. Hemavathy
{"title":"Fixed Point Theorems for Non-self Mappings Using Disconnected Graphs","authors":"R. O. Gayathri, R. Hemavathy","doi":"10.17485/ijst/v17i7.2497","DOIUrl":null,"url":null,"abstract":"Objectives: To prove the fixed point theorems for non-self mappings using disconnected graphs. Method: Graph theoretical approach is adopted to prove the fixed point theorems for non-self mappings. In all the previous works, connected graphs were used for establishing the results, but it is demonstrated in this work that disconnected graphs are best suited, and this new approach simplifies the proofs to a greater extent. Findings: The fixed point theorems by Banach, Kannan, Chatterjea, and Bianchini are proved using the new methodology. Novelty: An important part of the results concerning fixed point theorems is proving the iterated sequence to be a Cauchy sequence, and this is amalgamated with the edge sequence of the disconnected graph. Subject Classification: 54H25, 47H10 Keywords: Non-self mapping, Iterated sequence, Disconnected graph, Edge sequence, Fixed point","PeriodicalId":508200,"journal":{"name":"Indian Journal Of Science And Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Indian Journal Of Science And Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17485/ijst/v17i7.2497","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Objectives: To prove the fixed point theorems for non-self mappings using disconnected graphs. Method: Graph theoretical approach is adopted to prove the fixed point theorems for non-self mappings. In all the previous works, connected graphs were used for establishing the results, but it is demonstrated in this work that disconnected graphs are best suited, and this new approach simplifies the proofs to a greater extent. Findings: The fixed point theorems by Banach, Kannan, Chatterjea, and Bianchini are proved using the new methodology. Novelty: An important part of the results concerning fixed point theorems is proving the iterated sequence to be a Cauchy sequence, and this is amalgamated with the edge sequence of the disconnected graph. Subject Classification: 54H25, 47H10 Keywords: Non-self mapping, Iterated sequence, Disconnected graph, Edge sequence, Fixed point
使用断开图的非自映射定点定理
目标利用断开的图形证明非自映射的定点定理。方法: 采用图论方法证明非自映射的定点定理:采用图论方法证明非自映射的定点定理。在以前的所有著作中,连接图都被用来建立结果,但本著作证明了断开图是最合适的,而且这种新方法在更大程度上简化了证明。研究结果使用新方法证明了 Banach、Kannan、Chatterjea 和 Bianchini 的定点定理。新颖性:有关定点定理结果的一个重要部分是证明迭代序列是考奇序列,这与断开图的边序列合并在一起。学科分类:54H25, 47H10 关键词:非自映射 迭代序列 断开图 边序列 定点
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信