Revistas académicas de la Universidad Católica del Norte
Not a member yet
    1687 research outputs found

    On the strong geodeticity in the corona type product of graphs

    No full text

    A complete pair of solvents of a quadratic matrix pencil

    No full text

    Existence of nodal solutions for a superlinear  Dirichlet problem and topological degree

    No full text

    Random Fixed Point Theorems with Application to Random Differential Equations in Separable Suprametric Spaces endowed with a Graph

    No full text
    The aim of this paper is to present topological results in separable suprametric spaces. We prove random fixed point theorems for contractive maps in these complete separable suprametric spaces endowed with graphs. To illustrate the applicability of our results, we give an example involving random differential equations. Several examples are also included to illustrate the results

    On the hyperstability of a Cauchy-Jensen type functional equation in Banach spaces

    No full text
    In this paper, we establish some hyperstability results of the following Cauchy-Jensen functional equationin Banach spaces

    Computing the maximal signless Laplacian index among graphs of prescribed order and diameter

    No full text
    A bug Bugp,r1r2 is a graph obtained from a complete graph Kp by deleting an edge uv and attaching the paths Priand Pr2 by one of their end vertices at u and v, respectively. Let Q(G) be the signless Laplacian matrix of a graph G and q1(G) be the spectral radius of Q(G). It is known that the bug maximizes q1(G) among all graphs G of order n and diameter d. For a bug B of order n and diameter d, n - d is an eigenvalue of Q(B) with multiplicity n - d - 1. In this paper, we prove that remainder d +1 eigenvalues of Q(B), among them q1(B), can be computed as the eigenvalues of a symmetric tridiagonal matrix of order d +1. Finally, we show that q1(B0) can be computed as the largest eigenvalue of a symmetric tridiagonal matrix of order whenever d is even

    The t-pebbling number of Jahangir graph J3,m

    No full text
    The t-pebbling number, ft(G), of a connected graph G, is the smallest positive integer such that from every placement of ft(G) pebbles, t pebbles can be moved to any specified target vertex by a sequence of pebbling moves, each move removes two pebbles of a vertex and placing one on an adjacent vertex. In this paper, we determine the t-pebbling number for Jahangir graph J3,m and finally we give a conjecture for the t-pebbling number of the graph Jn,m

    Strongly(Vλ, A, Δn(vm),p, q)-summable sequence spaces defined by modulus function and statistical convergence

    No full text
    In this paper we introduce strongly (Vλ,A, Δnvm,p, q)-summable sequences and give the relation between the spaces of strongly (Vλ,A, Δnvm,p, q)-summable sequences and strongly (Vλ,A, Δnvm,p, q)-summable sequences with respect to a modulus function when A =(aik) is an infinite matrix of complex number, (Δnvm) is generalized difference operator, p = (pi) is a sequence of positive real numbers and q is a seminorm. Also we give the relationship between strongly (Vλ,A, Δnvm,p, q) - convergence with respect to a modulus function and strongly Sλ(A, Δn(vm))- statistical convergence

    Domatic Partition of Some Class of Graphs

    No full text

    232

    full texts

    1,687

    metadata records
    Updated in last 30 days.
    Revistas académicas de la Universidad Católica del Norte
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇