Browsing by Author "Mitjana Riera, Margarida"

Green’s kernel for subdivision networks

Carmona Mejías, Ángeles; Mitjana Riera, Margarida; Monsó Burgués, Enrique P.J. (2016)
Conference report
Open Access

Green’s kernel of Schrödinger operators on generalized subdivision networks

Carmona Mejías, Ángeles; Mitjana Riera, Margarida; Monsó Burgués, Enrique P.J. (2017)
Conference report
Open Access

Group inverse matrix of the normalized Laplacian on subdivision networks

Carmona Mejías, Ángeles; Mitjana Riera, Margarida; Monsó Burgués, Enrique P.J. (Universidad de Cádiz, 2017)
Conference report
Open Access

Inversa de matrices circulantes con tres parámetros

Mitjana Riera, Margarida (2015)
Conference report
Open Access

Utilizando técnicas relacionadas con la resolución de problemas de contorno para ecuaciones en diferencias de segundo orden, se dan condiciones necesarias y suficientes cientes para la invertibilidad de matrices circulantes ...

Kirchhoff index of periodic linear chains

Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (2015-02)
Article
Open Access

A periodic linear chain consists of a weighted 2n -path where new edges have been added following a certain periodicity. In this paper, we obtain the effective resistance and the Kirchhoff index of a periodic linear chain ...

Kirchhoff indexes of a network

Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Gesto Beiroa, José Manuel; Mitjana Riera, Margarida (Elsevier, 2010-04-15)
Article
Restricted access - publisher's policy

In this work we define the effective resistance between any pair of vertices with respect to a value λ ≥ 0 and a weight ω on the vertex set. This allows us to consider a generalization of the Kirchhoff Index of a finite ...

M-Matrix Inverse problem for distance-regular graphs

Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (2010)
Conference lecture
Open Access

M-Matrix Inverse problem for distance-regular graphs

Bendito Pérez, Enrique; Carmona Mejías, Ángeles; Encinas Bachiller, Andrés Marcos; Mitjana Riera, Margarida (Iniciativa Digital Politècnica, 2011)
Conference report
Open Access

We analyze when the Moore–Penrose inverse of the combinatorial Laplacian of a distance–regular graph is a M–matrix;that is, it has non–positive off–diagonal elements or, equivalently when the Moore-Penrose inverse of the ...