In this work we obtain easy characterizations for the boundedness of the solutions of the discrete, self–adjoint, second order and linear unidimensional equations with periodic coefficients, including the analysis of the ...

Let k=2 be an integer. Bermond and Thomassen conjectured that every digraph with minimum out-degree at least 2k-1 contains k vertex-disjoint cycles. Recently Bai, Li and Li proved this conjecture for bipartite digraphs. ...

We aim here at showing how the equilibrium measures for a finite network can be used to obtain simple expressions for both Green and Poisson kernels and hence we can deduce nice expressions of the hitting time and the ...

In this work, we present an algorithm to the recovery of the conductance of a 2– dimensional grid. The algorithm is based in the solution of some overdetermined partial boundary value problems defined on the grid.

In this paper, given a network and a subdivision of it, we show how the Group Inverse of the subdivision network can be related to the Group Inverse of initial given network. Our approach establishes a relationship between ...

In this work, we compute analitycally the Kirchhoff index and effective resistances of a weighted non–complete wheel that has been obtained by adding a vertex to a weighted cycle and some edges conveniently chosen. To this ...