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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
