Article ID Journal Published Year Pages File Type
423021 Electronic Notes in Theoretical Computer Science 2006 13 Pages PDF
Abstract

In this paper, a notion of convexity structure for graphs, called neighbourhood convexity, is introduced. It is shown that neighbourhood convexity is exactly the graph convexity for Helly graphs to be 2-Helly. We then consider various neighbourhood-convexity almost fixed point properties for Helly graphs. In particular, we show that for any positive number p, every Helly graph has the neighbourhood convexity -almost fixed point property for p-weak multifunctions; and any self-mapping neighbourhood convexity strong multifunction has a selection.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics