Герб МГТУ им. Н.Э. БауманаНаучно-техническая библиотека МГТУ им. Н.Э. Баумана

Подробное описание документа

   Статья

Alkhazragy A., Al-Hachami A. K. H., Mayah F.
   Notes on Strongly Semi-Closed Graph / Alkhazragy A., Al-Hachami A. K. H., Mayah F. - URL: https://vestniken.bmstu.ru/catalog/math/subst/1032.html (дата обращения: 11.03.2026). - DOI 10.18698/1812-3368-2022-3-17-27 // Вестник МГТУ им. Н. Э. Баумана. Сер. Естественные науки. - 2022. - № 3. - С. 17-27.

Скачать документ
Полнотекстовый документ
DOI 10.18698/1812-3368-2022-3-17-27
vestniken.bmstu.ru/catalog/math/subst/1032.html

In these papers, we study on mapping with strongly semi-closed graph. We first introduce the notion "strongly semi-closed graph" in analogue to the closed graph. Also, we study some of their basic properties. This study proved that: If Y is extremally s-disconnected semi-T2-space and f : X → Y is a set-s-connected surjection, then G(f) is semi-closed. If Y is Hausdorff space and f is almost semi continuous, then G(f) is strongly semi-closed. If Y is semi-T2-space and f is irresolute, then G(f) is strongly semi-closed. Semi-closed mapping and semi-closed graph are two separate concepts. If G(f) is a semi-closed and f is surjection(onto), then Y is semi-T1-space. If the injective S**-open map X is semi**-connected and G(f) is semi-closed then X is semi-T2-space provided it is T1-space and locally semi-connected. S**-closed mapping and semi-closed graph are two separate concepts. If Y is semi-regular space, then the following are equivalent G(f) is semi-closed and G(f) is strongly semi-closed Please cite this article as:Alkhazragy A., Al-Hachami A.K.H., Mayah F. Notes on strongly semi-closed graph. Herald of the Bauman Moscow State Technical University, Series Natural Sciences, 2022, no. 3 (102), pp. 17–27. DOI: https://doi.org/10.18698/1812-3368-2022-3-17-27

519.17 Теория графов

Статья опубликована в следующих изданиях

с. 17-27
   Журнал
   Вестник МГТУ им. Н. Э. Баумана. Сер. Естественные науки. - ISSN 1812-3368 (print). - ISSN 2686-8768 (web).
   № 3. - 2022.