Year: 2024
Type: article
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.
Source: jnanabha
Author: Kiran Dewangan
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4400511712