Abstract
In this paper, the concepts of power graphs and power complexes are introduced. The multifunctions for graphs are denned and will be classified. The concept of simplicial mappings for complexes then is extended to multifunctions. A notion of weak convexity is defined in the intersection graphs of (3− 1)-adjacent n-dimensional real digital pictures based on the usual Euclidean convex closure operator. It is shown that any (3 − 1)-adjacent n-dimensional digital picture has the simplicial weak convex almost fixed point property, which may be considered as a digital version of the Kakutani fixed point theorem for convex-valued multifunctions.
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.
