Zobrazeno 1 - 4
of 4
pro vyhledávání: '"symmetric m–matrices"'
Publikováno v:
Special Matrices, Vol 9, Iss 1, Pp 275-296 (2021)
By using combinatorial techniques, we obtain an extension of the matrix-tree theorem for general symmetric M-matrices with no restrictions, this means that we do not have to assume the diagonally dominance hypothesis. We express the group inverse of
Externí odkaz:
https://doaj.org/article/a4066ae4d07c4030855bfe10d5cb9c5b
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Special Matrices, Vol 9, Iss 1, Pp 275-296 (2021)
Universitat Politècnica de Catalunya (UPC)
Special Matrices, Vol 9, Iss 1, Pp 275-296 (2021)
By using combinatorial techniques, we obtain an extension of the matrix-tree theorem for general symmetric M-matrices with no restrictions, this means that we do not have to assume the diagonally dominance hypothesis. We express the group inverse of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7d8941d09cd5fb261f782b8eda092d9
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
This paper aims to study a family of distances in networks associated with effective resistances. Specifically, we consider the effective resistance distance with respect to a positive parameter and a weight on the vertex set; that is, the effective
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6401b35cd5d865b115d5d10e9e40626c
https://hdl.handle.net/2117/105199
https://hdl.handle.net/2117/105199
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.