Please use this identifier to cite or link to this item:
https://doi.org/10.1016/S0898-1221(99)00240-0
| Title: | Continuation methods for closed, weakly closed, DKT, and WDKT maps | Authors: | Agarwal, R.P. O'Regan, D. |
Issue Date: | Oct-1999 | Citation: | Agarwal, R.P., O'Regan, D. (1999-10). Continuation methods for closed, weakly closed, DKT, and WDKT maps. Computers and Mathematics with Applications 38 (7) : 81-88. ScholarBank@NUS Repository. https://doi.org/10.1016/S0898-1221(99)00240-0 | Abstract: | A simple approach is presented to establish that if F is essential and F ≅ G, then G is essential. We discuss (i) the case when the multivalued map has closed (or weakly closed) graph, and (ii) the case when the set valued map has continuous (or weakly continuous) selections. | Source Title: | Computers and Mathematics with Applications | URI: | http://scholarbank.nus.edu.sg/handle/10635/103059 | ISSN: | 08981221 | DOI: | 10.1016/S0898-1221(99)00240-0 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.