Abstract
The aim of this paper is to present graphical version of Brouwer’s fixed point theorem and to establish some useful results of partial order set and nonexpansive mapping defined on a partial order set. One application of the fixed point theory by combining graph theory is discussed here by using Dijkstra’s algorithms which is useful in computer science.
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.
