Articles de revista: Recent submissions
Now showing items 112 of 29

Vertexdisjoint cycles in bipartite tournaments
(201610)
Article
Open AccessLet k=2 be an integer. Bermond and Thomassen conjectured that every digraph with minimum outdegree at least 2k1 contains k vertexdisjoint cycles. Recently Bai, Li and Li proved this conjecture for bipartite digraphs. ... 
Equilibrium measures on finite networks. Effective resistance and hitting time
(2001)
Article
Open AccessWe 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 ... 
DirichlettoRobin matrix on networks
(2014)
Article
Open AccessIn this work, we de ne the Dirichlet{to{Robin matrix associated with a Schr odinger type matrix on general networks, and we prove that it satis es the alternating property which is essential to characterize those matrices ... 
Recovering the conductances on grids
(2014)
Article
Restricted access  publisher's policyIn 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. 
Resistance distances on networks
(2017)
Article
Open AccessThis paper aims to study a family of distances in networks associated witheffective resistances. Speci cally, we consider the e ective resistance distance with respect to a positive parameter and a weight on the vertex ... 
The group inverse of subdivision networks
(201610)
Article
Open AccessIn 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 ... 
A family of mixed graphs with large order and diameter 2
(201702)
Article
Open AccessA mixed regular graph is a connected simple graph in which each vertex has both a fixed outdegree (the same indegree) and a fixed undirected degree. A mixed regular graphs is said to be optimal if there is not a mixed ... 
Kirchhoff index of a noncomplete wheel
(2016)
Article
Open AccessIn 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 ... 
Effective resistances and Kirchhoff index in subdivision networks
(Taylor & Francis, 20161112)
Article
Open AccessWe define a subdivision network ¿S of a given network ¿; by inserting a new vertex in every edge, so that each edge is replaced by two new edges with conductances that fulfill electrical conditions on the new network. In ... 
Overdetermined partial boundary value problems on finite networks
(20150301)
Article
Open AccessIn this study, we define a class of nonselfadjoint boundary value problems on finite networks associated with Schrodinger operators. The novel feature of this study is that no data are prescribed on part of the boundary, ... 
Recovering the conductances on grids: A theoretical justification
(2016)
Article
Open AccessIn this work, we present an overview of the work developed by the authors in the context of inverse problems on nite networks. This study performs an extension of the pioneer studies by E.B. Curtis and J.A. Morrow, ... 
On the acyclic disconnection and the girth
(20150511)
Article
Open AccessThe acyclic disconnection, (omega) over right arrow (D), of a digraph D is the maximum number of connected components of the underlying graph of D  A(D*), where D* is an acyclic subdigraph of D. We prove that (omega) over ...