The aim of this paper is to present a weak form of -light functions by using -open set which is -light function, and to offer new concepts of disconnected spaces and totally disconnected spaces. The relation between them have been studied. Also, a new form of -totally disconnected and inversely -totally disconnected function have been defined, some examples and facts was submitted.
A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.
The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.
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.
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.
Several authors have used ranking function for solving linear programming problem. In This paper is proposed two ranking function for solving fuzzy linear programming and compare these two approach with trapezoidal fuzzy number .The proposed approach is very easy to understand and it can applicable, also the data were chosen from general company distribution of dairy (Canon company) was proposed test approach and compare; This paper prove that the second proposed approach is better to give the results and satisfy the minimal cost using Q.M. Software
The reaction of LAs-Cl8 : [ (2,2- (1-(3,4-bis(carboxylicdichloromethoxy)-5-oxo-2,5- dihydrofuran-2-yl)ethane – 1,2-diyl)bis(2,2-dichloroacetic acid)]with sodium azide in ethanol with drops of distilled water has been investigated . The new product L-AZ :(3Z ,5Z,8Z)-2- azido-8-[azido(3Z,5Z)-2-azido-2,6-bis(azidocarbonyl)-8,9-dihydro-2H-1,7-dioxa-3,4,5- triazonine-9-yl]methyl]-9-[(1-azido-1-hydroxy)methyl]-2H-1,7-dioxa-3,4,5-triazonine – 2,6 – dicarbonylazide was isolated and characterized by elemental analysis (C.H.N) , 1H-NMR , Mass spectrum and Fourier transform infrared spectrophotometer (FT-IR) . The reaction of the L-AZ withM+n: [ ( VO(II) , Cr(III) ,Mn(II) , Co(II) , Ni(II) , Cu(II) , Zn(II) , Cd(II) and Hg(II)] has been i
... Show MoreIn this article, an attempt has been made to introduce the concept of Neutrosophic d-Filter and Neutrosophic Prime d-Filter of d-Algebra by generalizing the notion of Intuitionistic Fuzzy d-Filter of d-Algebra. Besides, we establish different properties of them. Further, we study several relations on this notion from the point of view of Neutrosophic d-Algebra.
Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont
... Show MoreToday, the prediction system and survival rate became an important request. A previous paper constructed a scoring system to predict breast cancer mortality at 5 to 10 years by using age, personal history of breast cancer, grade, TNM stage and multicentricity as prognostic factors in Spain population. This paper highlights the improvement of survival prediction by using fuzzy logic, through upgrading the scoring system to make it more accurate and efficient in cases of unknown factors, age groups, and in the way of how to calculate the final score. By using Matlab as a simulator, the result shows a wide variation in the possibility of values for calculating the risk percentage instead of only 16. Additionally, the accuracy will be calculate
... Show More