Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...

a problem that sometimes occurs in multiobjective optimization is the existence of a large set of fairly effcient solutions. hence, the decision making based on selecting a unique preferred solution is diffcult. considering models with fair b-effciency relieves some of the burden from the decision maker by shrinking the solution set, since the set of fairly b-efficient solutions is contained with...

This paper discusses the position of Set B pronouns in Proto-Mayan. While previous reconstructions differ from each other with regard to exact that occupied respect predicate (alwayspreceding, always following, or sometimes preceding and following word), all them assume attached just as they usually do modern Mayan languages. Based on cases colonial languages where attach either a non-predicate...

In this paper, we procure the notions of neutrosophic simply b-open set, cover, and b-compactness via topological spaces. Then, establish some remarks, propositions, theorems on simply
 b-compactness. Further, furnish counter examples where result fails.