Revistas académicas de la Universidad Católica del Norte
Not a member yet
1687 research outputs found
Sort by
A semilinear non-homogeneous problem related to Korteweg-de Vries Equation
No full textIn this paper, we consider a non-homogeneous generalized Korteweg-de Vries problem with some hypotheses on the right-hand side, and we give a new regularity result of the solution in an anisotropic Sobolev space. Then we apply the obtained result to a non-homogeneous KdV problem. This work is an extension of solvability results for a right-hand side f in Lebesgue space
Further studies on circulant completion of graphs
No full textA circulant graph C(n,S) is a graph having its adjacency matrix as a circulant matrix. It can also be intrepreted as a graph with vertices v0,v1,...,vn-1 that are in one to one correspondence with the members of Zn and with edge set {vivj:i-j ∈ S}, where S known as the connection set or symbol, is a subset of non-identity members of Zn that is closed under inverses. This work extends the study of circulant completion and general formulae for calculating circulant completion number in two different perspectives, one in terms of circulant span and the other in terms of adjacency matrix
Induced Dominating Sequence and ESD Graphs
No full textA vertex subset D of a graph G = (V,E) is said to be a dominating set if every vertex in G is either in D or adjacent to some vertex in D. The minimum cardinality of such a set is the domination number, which is denoted as γ(G). In this paper, we define a sequence associated with the domination concept in graphs and studied the basic properties of the sequence in terms of various parameters of graphs. Using this sequence we order the vertices of a dominating set according its significance and propose Equally Significant Dominating (ESD) graphs. We also introduced domination related topological indices and compute their lower bounds for trees, unicyclic graphs and bicyclic graphs. All the graphs attaining the bounds are characterized
Rees factor S-posets satisfying Conditions (PWP)sw, (WP)sw and (Psw)
No full textIn [{\it Comm. Algebra}, vol. 37, pp. 1995-2007], Golchin and Rezaei gave necessary and sufficient conditions for a Rees factor -post , by a convex proper right ideal , to satisfy Conditions or . They also introduced two new \ Conditions \ \ \ \ and \\. In [{\it J. Sci. Islam. Repub. Iran}, 25(4), 369-377], Golchin and Nouri introduced three new Conditions , and and compare these conditions \ \ and \ \ Conditions \ \ , , , \\, and . They described these properties by po-surjectivity of corresponding to certain subpullback diagrams. Also, they described Conditions , and by weak po-surjectivity of corresponding to certain subpullback diagrams. In this article we try to give a necessary and sufficient condition for a Rees factor -poset , by a convex right ideal , to satisfy Conditions , and
Ball convergence of derivative free iterative methods with or without memory using weight operator technique
No full textA method without memory as well as a method with memory are developed free of derivatives for solving Banach space valued equations. Their ball convergence analysis is provided using only the derivative and the divided difference of order one in contrast to earlier works on the real line using the fifth as well as the seventh derivative. This way the applicability is expanded for these methods
A Mathematical modelling for co-infection dynamics of Japanese encephalitis-Dengue and influence of JE Vaccine on Dengue disease
No full textA non-linear deterministic mathematical model has been described with the co-infection dynamics of Japanese encephalitis(JE) and dengue disease, incorporating the JE vaccine. A basic reproduction number is discussed to study transmission potential of the co-infection model. In co-infection model, disease-free equilibrium points of Japanese encephalitis and dengue, along with endemic, are presented in system and investigated their stability with the help of their specified method. Our analysis suggests that vaccination against Japanese encephalitis positively affect control of co-infection. By using Center Manifold Theory, the model undergoes backwards bifurcation phenomenon and this has been occurred when basic reproduction number is smaller than unity. It is shown that by taking simultaneous preventive steps, the basic reproduction number of co-infection can be reduced to less than one after eliminating both infections. Sensitivity analysis has been performed to determine which parameters significantly affect disease dynamics. The effects of these parameters on transmission of disease were investigated using a numerical simulation. According to the findings, we obtain that JE-dengue co-infection can be managed with use of JE vaccine, also minimize JE transmission rate rapidly
On the total edge irregularity strength of certain classes of cycle related graphs
No full textFor a graph G=(V,E), an edge irregular total k-labeling is a labeling of the vertices and edges of G with labels from the set {1, 2, ..., k } such that any two different edges have distinct weights. The sum of the label of edge uv and the labels of vertices u and v determines the weight of the edge uv. The smallest possible k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. We determine the exact value of the total edge irregularity strength for some cycle related graphs
Study on ΛδS−sets I
No full textSeveral authors started to extend the concept of δ-open sets via var-ious types of generalizations. In 1997, Park et al. introduced a weaker
form of δ-open sets called δ-semiopen sets stronger than semiopensets. Maki [6] initiated the notion Λ-sets in topological spaces as theintersection of all open supersets of R. Georgiou et al. [4] definedΛδ-sets, (Λ,δ)-closed and studied. The main aim of this paper is tointroduce an operator ΛδS using δ-semiopen sets and the concept of
(Λ,δS)-closed sets in topological spaces. The notions ΛδS(R), ΛδS-sets, Λ∗
δS(R), Λ∗δS-set, (Λ,δS)-closed sets and λδS
g-closed sets are de-fined and their properties are studied. It is proved that λδS
g-closedsets are weaker than δ-open and δ-semi open sets but stronger thangδS-open sets, δgs-open sets
Group vertex magic labeling of some special graphs
No full textFor any additive abelian group . Let be an element of , a graph is said to be -vertex magic graph if there exist a labeling function such that for any vertex of , where is the set of the open neighborhood of . In this paper, we prove that the graphs such as wheel, Corona , subdivision of ladder and -fold wheel for nor are -vertex magic graphs. Also we prove that the subdivide wheel, helm and closed helm are -vertex magic graphs. However we prove that the triangular book and -fold wheel for are group vertex magic graphs
Coloring of Non-Zero Component Graphs
No full textThe non-zero component graph of finite dimensional vector space V over a finite field F is the graph G(Vα)= (V,E), where vertices of G(Vα) are the non-zero vectors in V, two of which are adjacent if they share at least one basis vector with non-zero coefficient in their basic representation. In this paper, we study the various types of colorings of non-zero component graph