The main objective of this work is to introduce and investigate fixed point (F. p) theorems for maps that satisfy contractive conditions in weak partial metric spaces (W.P.M.S), and give some new generalization of the fixed point theorems of Mathews and Heckmann. Our results extend, and unify a multitude of (F. p) theorems and generalize some results in (W.P.M.S). An example is given as an illustration of our results.

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.

Indexes of topological play a crucial role in mathematical chemistry and network theory, providing valuable insights into the structural properties of graphs. In this study, we investigate the Resize graph of G2(3), a significant algebraic structure arising from the exceptional Lie group (G2) over the finite field F3. We compute several well-known topological indices, including the Zagreb indices, Wiener index, and Randić index, to analyze the graph's connectivity and complexity. Our results reveal intricate relationships between the algebraic structure of G2(3) and its graphical properties, offering a deeper understanding of its combinatorial and spectral characteristics. These findings contribute to the broader study of algebraic graph t

In this paper, Min-Max composition fuzzy relation equation are studied. This study is a generalization of the works of Ohsato and Sekigushi. The conditions for the existence of solutions are studied, then the resolution of equations is discussed.

In this paper, we apply the notion of a bipolar fuzzy n-fold KU-ideal of KU- algebras. We introduce the concept of a bipolar fuzzy n-fold KU-ideal and investigate several properties. Also, we give relations between a bipolar fuzzy n- fold KU-ideal and n-fold KU-ideal. The image and the pre-image of bipolar fuzzy n-fold KU-ideals in KU-algebras are defined and how the image and the pre- image of bipolar fuzzy n-fold KU-ideals in KU-algebras become bipolar fuzzy n- fold KU-ideals are studied. Moreover, the product of bipolar fuzzy n-fold KU- ideals in Cartesian product KU-algebras is given.

The notion of interval value fuzzy k-ideal of KU-semigroup was studied as a generalization of afuzzy k-ideal of KU-semigroup. Some results of this idea under homomorphism are discussed. Also, we presented some properties about the image (pre-image) for interval~ valued fuzzy~k-ideals of a KU-semigroup. Finally, the~ product of~ interval valued fuzzyk-ideals is established.

The last decade of this 20th century provides a wide spread of applications of one of the computer techniques, which is called Fuzzy Logic. This technique depends mainly on the fuzzy set theory, which is considered as a general domain with respect to the conventional set theory. This paper presents in initiative the fuzzy sets theory and fuzzy logic as a complete mathematics system. Here it was explained the concept of fuzzy set and defined the operations of fuzzy logic. It contains eleven operations beside the other operations which related to fuzzy algebra. Such search is considered as an enhancement for supporting the others waiting search activities in this field.

Simulation  of  the  Linguistic  Fuzzy Trust  Model  (LFTM)  over  oscillating  Wireless  Sensor Networks (WSNs) where the goodness of the servers belonging to them could change along the time is presented in this paper, and the comparison between the outcomes achieved with LFTM model over oscillating WSNs with the outcomes obtained by applying the model over static WSNs where the servers maintaining always the same goodness, in terms of the selection percentage of trustworthy servers (the accuracy of the model) and the average path length are also presented here. Also in this paper the comparison between the LFTM and the Bio-inspired Trust and Reputation Model for Wireless Sensor Network