ENCLAVELESS SETS IN GRAPHS
Far East Journal of Mathematical Sciences (FJMS) · 11.03.2026 · 143 (4) · 1039-1055
DOI: 10.17654/0972087126060 ↗Kurz gefasst
Fachartikel in der Zeitschrift Far East Journal of Mathematical Sciences (FJMS), online erschienen am 11.03.2026. Verfasst von Devine Fathy Mae Grino und 1 weiteren Autor:innen.
Abstract (Originalsprache)
This study explores enclaveless sets in graphs, where a set is enclaveless if no vertex in S is an enclave, meaning no vertex has its closed neighborhood entirely contained within the set. The paper establishes general bounds for key parameters such as the enclaveless number, independence number, and domination number, and provides characterizations for various families of graphs, including paths, cycles, complete graph, bipartite graph, and star graph. Exact formulas are derived, including Nordhaus-Gaddum-type inequalities for the enclaveless number. The study also examines the relationship between enclaveless sets and graph connectivity.
Zitieren
APA
Grino, D. F. M., & Jr, I. C. (2026). ENCLAVELESS SETS IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS), 143(4), 1039-1055. https://doi.org/10.17654/0972087126060
Vancouver
Grino DFM, Jr IC. ENCLAVELESS SETS IN GRAPHS. Far East Journal of Mathematical Sciences (FJMS). 2026;143(4):1039-1055. doi:10.17654/0972087126060
BibTeX
@article{Grino2026,
author = {Grino, Devine Fathy Mae and Jr, Isagani Cabahug .},
title = {ENCLAVELESS SETS IN GRAPHS},
journal = {Far East Journal of Mathematical Sciences (FJMS)},
year = {2026},
volume = {143},
number = {4},
pages = {1039--1055},
doi = {10.17654/0972087126060}
}
EUVIMED