COMPTHE - Combinatòria i Teoria Discreta del Potencial pel control de paràmetres en xarxes
L'activitat investigadora del grup COMPTHE s'emmarca en el context de la matemàtica aplicada, concretament en matemàtica discreta i combinatòria. S'estudien problemes extremals en grafs per millorar-ne fites conegudes i per construir noves famílies de grafs extremals. La robustesa de les xarxes s'analitza fent servir paràmetres com ara la connectivitat, la vulnerabilitat, la dominació o la resistència efectiva. Per altra banda, l'anàlisi de dades a la frontera d'una xarxa possibilita analitzar-ne la seva estructura interna.
Collections in this community
-
Articles de revista [29]
Recent Submissions
-
Bounded solutions of self-adjoint second order linear difference equations with periodic coefficients
(2018-02-25)
Article
Open AccessIn 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 ... -
Second order linear difference equations
(2017-12-04)
Article
Open AccessWe provide the explicit solution of a general second order linear difference equation via the computation of its associated Green function. This Green function is completely characterized and we obtain a closed expression ... -
Vertex-disjoint cycles in bipartite tournaments
(2016-10)
Article
Open AccessLet 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. ... -
Triangular matrices and combinatorial recurrences
(2017)
Conference report
Restricted access - publisher's policy -
Characterizing identifying codes through the spectrum of a graph or digraph
(2017)
Conference report
Open Access -
Funciones de green en redes producto
(Universidad de Cádiz, 2017)
Conference report
Restricted access - publisher's policyEn esta comunicación presentaremos la versión discreta del método de separación de variables para determinar la función de Green de redes producto en términos de la función de Green de uno de las redes factores y los ... -
Cálculo de la inversa de una matriz de Jacobi
(Universidad de Cádiz, 2017)
Conference report
Restricted access - publisher's policyEn este trabajo aportamos las condiciones necesarias y suficientes para la invertibilidad de las matrices de Jacobi y calculamos explícitamente su inversa. Las técnicas que utilizamos están relacionadas con la soluciones ... -
Resistive distances on networks
(2016)
Conference report
Open Access -
Discrete inverse problem on grids
(2016)
Conference report
Open AccessIn this work, we present an algorithm to the recovery of the conductance of a n –dimensional grid. The algorithm is based in the solution of some overdetermined partial boundary value problems defined on the grid; that is, ... -
Green’s kernel for subdivision networks
(2016)
Conference report
Open Access -
Effective resistances and Kirchhoff index in subdivision networks
(2016)
Conference report
Restricted access - publisher's policyIn this work we compute the effective resistances and the Kirchhoff Index of subdivision networks in terms of the corresponding parameters of the original network. Our techniques are based on the study of discrete operators ... -
Green's function of a weighted $n$-cycle
(2016)
Conference report
Open Access