In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

This paper introduces a generalization sequence of positive and linear operators of integral type based on two parameters to improve the order of approximation. First, the simultaneous approximation is studied and a Voronovskaja-type asymptotic formula is introduced. Next, an error of the estimation in the simultaneous approximation is found. Finally, a numerical example to approximate a test function and its first derivative of this function is given for some values of the parameters. 

  In this paper, we define the bg**-connected space and study the relation between this space and other kinds of connected spaces .Also we study some types of continuous functions and study the relation among (connected space, b-connected space,  bg-connected  space and bg**-connected space) under these types of continuous functions.  

     Let  be any connected graph with vertices set  and edges set .  For any two distinct vertices  and , the detour distance between  and  which is denoted by  is a longest path between  and  in a graph . The detour polynomial of a connected graph  is denoted by ;  and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.

     The Syriac language is one of the ancient Semitic languages that appeared in the first century AD. It is currently used in a number of cities in Iraq, Turkey, and others. In this research paper, we tried to apply the work of  Ali and Mahmood 2020  on the letters and words in the Syriac language to find a new encoding for them and increase the possibility of reading the message by other people.

A graph
is said to be singular if and only if its adjacency matrix is singular. A graph
is said to be bipartite graph if and only if we can write its vertex set as
, and each edge has exactly one end point in
and other end point in
. In this work, we will use graphic permutation to find the determinant of adjacency matrix of bipartite graph. After that, we will determine the conditions that the bipartite graph is singular or non-singular.

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.

The concept of -closedness, a kind of covering property for topological spaces, has already been studied with meticulous care from different angles and via different approaches. In this paper, we continue the said investigation in terms of a different concept viz. grills. The deliberations in the article include certain characterizations and a few necessary conditions for the -closedness of a space, the latter conditions are also shown to be equivalent to -closedness in a - almost regular space. All these and the associated discussions and results are done with grills as the prime supporting tool.