APAV - Academy of Sciences, Letters, Arts and Technology (E-Journals)
Not a member yet
757 research outputs found
Sort by
Semi generalization of δI*-closed sets in ideal topological space
In this paper we introduce the notion of semi generalized dI*-closed sets or gsdI*-closed sets using semi open sets and investigate its basic properties and characterizations in an ideal topological space. This class of sets is properly lies between the class of dI*-closed sets and the class of g-closed sets. Also, study the relationship with various existing closed sets in ideal topological spaces. Moreover, we introduce and study the concept of maximal gsdI*-closed set
Soft Semi*δ-continuity in Soft Topological Spaces
In this paper, we introduce the concept of soft semi* -continuous functions and soft semi* -irresolute functions in soft topological spaces. Also, we investigate its properties and study its relation with other soft continuous function
Some Graph Parameters of Clique graph of Cyclic Subgroup graph on certain Non-Abelian Groups
The aim of this paper is to examine various graph parameters of clique graph of cyclic subgroup graph on certain non-abelian groups and also we obtain some theorems and results in detai
A Study On The Number Of Edges Of Some Families Of Graphs And Generalized Mersenne Numbers
The relationship between the Nandu sequence of the SM family of graphs and the generalized Mersenne numbers is demonstrated in this study. The sequences obtained from the peculiar number of edges of SM family of graphs are known as Nandu sequences. Nandu sequences are related to the two families of SM sum graphs and SM balancing graphs. The SM sum graphs are established from the inherent relationship between powers of 2 and natural numbers, whereas the SM balancing graphs are linked to the balanced ternary number system. In addition, some unusual prime numbers are discovered in this paper. These prime numbers best suit as an alternate for the Mersenne primes in the case of the public key cryptosystem
On Integer Cordial Labeling of Some Families of Graphs
An integer cordial labeling of a graph is an injective map or as is even or odd, which induces an edge labeling defined by such that the number of edges labelled with 1 and the number of edges labelled with 0 differ at most by 1. If a graph has integer cordial labeling, then it is called integer cordial graph. In this paper, we have proved that the Banana tree, , Olive tree, Jewel graph, Jahangir graph, Crown graph admits integer cordial labeling.
Soft 〖"Pre" 〗^*-Generalized Continuous Functions in Soft Topological Spaces
The aim of this paper is to define a new class of generalized continuous functions called soft -generalized continuous functions and soft -generalized irresolute functions in soft topological spaces. We discuss several characterizations of soft -generalized continuous and irresolute functions and also investigate their relationship with other soft continuous function
The Upper and Forcing Fault Tolerant Geodetic Number of a Graph
A fault tolerant geodetic is said to be minimal fault tolerant geodetic set of if no proper subset of is a fault tolerant geodetic set of is called the upper fault tolerant geodetic number of is denoted by . Some general properties satisfied by this concept are studied. For connected graphs of order with to be is given. It is shown that for every pair of with , there exists a connected graph such that and , where is the fault tolerant geodetic number of and is the upper fault tolerant geodetic number of a graph. Let S be a -set of . A subset is called a forcing subset for if is the unique -set containing T. A forcing subset for of minimum cardinality is a minimum forcing subset of . The forcing fault tolerant geodetic number of S, denoted by, is the cardinality of a minimum forcing subset of . The forcing fault tolerant geodetic number of , denoted by is , where the minimum is taken over all -sets in . The forcing fault tolerant geodetic number of some standard graphs are determined. Some of its general properties are studied. It is shown that for every pair of positive integers and with and there exists a connected graph such that an
Arboricity And Span In Fuzzy Chromatic Index
A fuzzy matching is a set of edges in which an edge does not incident on a vertex with same membership value. If every vertex of fuzzy graph is M-Plunged then the fuzzy matching is called as fair fuzzy matching. In this chapter, fuzzy coloring and fuzzy chromatic index are defined. The concept of Arboricity and span in fuzzy chromatic index are discussed in detail. Some theorems based on these concepts are proved
The Ahpsort II To Evaluate The High Level Instruction Performances
This paper aims to propose a model for ranking Italian high schools based on the several performance outputs. In order to analyze the performance of Italian public High Schools we consider the students’ school performance and their academic achievements; also the school characteristics may influence the performance evaluation of high schools, although the importance of these aspects is certainly less than the results achieved by students.Data are from Eduscopio and ScuolaInChiaro portals and refers to the 2019/20 school year. We analyze a sample of 263 high schools (HS) in all Italian Regions. For each school we consider nine outputs related to students' school and academic performance, and school characteristics. We assess the performance of high schools using a multi-criteria approach. Our analysis involves a high number of schools, so we apply the AHPSort II method which in addition to defining the ranking of schools also defines their classification. Our results show that scientific lyceums are all in the first class regardless the geographic area
Vague Positive Implicative And Associative W-implicative Ideals Of Lattice Wajsberg Algebras
In this paper, we introduce the definitions of the vague positive implicative W-implicative ideal and the vague associative W-implicative ideal of lattice Wajsberg algebra. Moreover, we give the relationship between the vague associative W-implicative ideal and the vague W-implicative ideal. Furthermore, we prove that every vague positive implicative W-implicative ideal is a vague W-implicative ideal