The purpose of this paper is to consider fibrewise near versions of the more important separation axioms of ordinary topology namely fibrewise near T0 spaces, fibrewise near T1 spaces, fibrewise near R0 spaces, fibrewise near Hausdorff spaces, fibrewise near functionally Hausdorff spaces, fibrewise near regular spaces, fibrewise near completely regular spaces, fibrewise near normal spaces and fibrewise near functionally normal spaces. Also we give several results concerning it.

The aim of the research is to apply fibrewise multi-emisssions of the paramount separation axioms of normally topology namely fibrewise multi-T0. spaces, fibrewise multi-T1 spaces, fibrewise multi-R0 spaces, fibrewise multi-Hausdorff spaces, fibrewise multi-functionally Hausdorff spaces, fibrewise multi-regular spaces, fibrewise multi-completely regular spaces, fibrewise multi-normal spaces and fibrewise multi-functionally normal spaces. Also we give many score regarding it.

The aim of this paper is to look at fibrewise slightly issuances of the more important separation axioms of ordinary topology namely fibrewise said to be fibrewise slightly T0 spaces, fibrewise slightly T1spaces, fibrewise slightly R0 spaces, fibrewise slightly T2 spaces, fibrewise slightly functionally T2 spaces, fibrewise slightly regular spaces, fibrewise slightly completely regular spaces, fibrewise slightly normal spaces. In addition, we announce and confirm many proposals related to these concepts.

Most real-life situations need some sort of approximation to fit mathematical models. The beauty of using topology in approximation is achieved via obtaining approximation for qualitative subgraphs without coding or using assumption. The aim of this paper is to apply near concepts in the -closure approximation spaces. The basic notions of near approximations are introduced and sufficiently illustrated. Near approximations are considered as mathematical tools to modify the approximations of graphs. Moreover, proved results, examples, and counterexamples are provided.

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

The research demonstrates new species of the games by applying separation axioms via  sets, where the relationships between the various species that were specified and the strategy of winning and losing to any one of the players, and their relationship with the concepts of separation axioms via  sets have been studied.