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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
