Revistas académicas de la Universidad Católica del Norte
Not a member yet
1687 research outputs found
Sort by
Some pairwise weakly Fuzzy mappings
No full textThe aim of this paper is to introduce some pairwise weakly fuzzy mappings, called pairwise weakly fuzzy δ-semi-pre-continuous mappings and pairwise weakly fuzzy δ-semi pre-open mappings in fuzzy bitopological spaces. The concept of pairwise weakly fuzzy δ-semi-precontinuous mappings is to be introduced in fuzzy bitopological spaces with the help of the concept of (i, j)-fuzzy pre-open and (i, j)-fuzzy δ-semi pre-open set. Then some of its basic properties and characterization theorems are to be investigated. Also the notion of pairwise weakly fuzzy δ-semi-pre-open mappings is to be introduced in fuzzy bitopological spaces with the help of the concept of (i, j)-fuzzy open set and (i, j)-fuzzy δ-semi pre-interior. Some of its basic properties and its relationship with other known mappings are also to be studied
Codes detecting, locating and correcting random errors occurring in multiple sub-blocks
No full textIn this paper, we study bounds on the number of check digits of linear codes that can detect multiple sub-blocks each affected by e or less random errors and can locate such corrupted multiple sub-blocks. Further, we obtain an upper bound on the number of check digits of linear codes which can correct such errors occurring in multiple sub-blocks. We also give examples of such codes
Rainbow neighbourhood number of graphs
No full textIn this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely the rainbow neighbourhood number and report on preliminary results thereof. The closed neighbourhood N [v] of a vertex v ∈ V (G) which contains at least one coloured vertex of each colour in the chromatic colouring of a graph is called a rainbow neighbourhood. The number of rainbow neighbourhoods in a graph G is called the rainbow neighbourhood number of G, denoted by rχ(G). We also introduce the concepts of an expanded line graph of a graph G and a v-clique of v ∈ V (G). With the help of these new concepts, we also establish a necessary and sufficient condition for the existence of a rainbow neighbourhood in the line graph of a graph G
On asymptotic commutativity degree of finite groups
No full textThe aim of this paper is to give a detailed account of a problema posed by P. Lescot regarding asymptotic commutativity degree of finite groups
Construction of Sequences of Borderenergetic Graphs
No full textThe graphs whose energy is same as that of complete graphs are known as borderenergetic graphs. We propose a procedure for the construction of borderenergetic graphs and investigate three sequences of borderenergetic graphs
Stability of two variable pexiderized quadratic functional equation in intuitionistic fuzzy Banach spaces
No full textThe present work is about the stability of a Pexiderised quadratic functional equation. The study is in the framework of intuitionistic fuzzy Banach spaces. The approach is through a fixed point method. The stability studied is Hyers-Ulam-Rassias stability type
Radius problem for the class of analytic functions based on Ruscheweyh derivative
No full textLet ? be the class of analytic functions f (z) with the normalized condition f(0) = f 0(0)−1 = 0 in the open unit disk U. Bymaking use of Ruscheweyh derivative operator, a new subclass ?(β1, β2, β3, β4; λ) of f(z) ∈ ? satisfying the inequalit
On semi-open sets and Feebly open sets in generalized topological spaces
No full textIn this paper, we introduce the notion of semi-open sets and feebly open sets in generalized topological spaces. Several properties of these notions are discussed. Also this paper considers (semi and feebly)-separation axioms for generalized topological spaces. We further investigate (semi-continuous, feebly-continuous, almost open)-functions in generalized topological spaces
θ ω−Connectedness and ω −R 1 properties
No full textWe use the theta omega closure operator to define theta omega connectedness as a property which is weaker than connectedness and stronger than θ-connectedness. We give several sufficient conditions for the equivalence between θ ω -connectedness and connectedness, and between θω-connectedness and θ-connectedness. We give two results regarding the union of θω-connected sets and also we show that the weakly θ ω -continuous image of a connected set is θ ω -connected. We define and investigate V -θ ω -connectedness as a strong form of V - θ-connectedness, and we show that the θ ω -connectedness and V -θ ω -connectedness are independent. We continue the study of R 1 as a known topological property by giving several results regarding it. We introduce ω-R 1 (I), ω-R 1 (II), ω-R 1 (III) and weakly ω-R 1 as four weaker forms of R 1 by utilizing ω-open sets, we give several relationships regarding them and we raise two open questions
On star coloring of degree splitting of join graphs
No full textA star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number χ s (G) of G is the least number of colors needed to star color G. In this paper, we have generalized the star chromatic number of degree splitting of join of any two graph G and H denoted by G + H, where G is a path graph and H is any simple graph. Also, we determine the star chromatic number for degree splitting of join of path graph G of order m with path P n , complete graph K n and cyclevgraph C n