<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-04-19T17:36:03Z</responseDate><request verb="GetRecord" identifier="oai:www.recercat.cat:2117/105199" metadataPrefix="oai_dc">https://recercat.cat/oai/request</request><GetRecord><record><header><identifier>oai:recercat.cat:2117/105199</identifier><datestamp>2026-02-07T07:35:51Z</datestamp><setSpec>com_2072_1033</setSpec><setSpec>col_2072_452950</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Resistance distances on networks</dc:title>
   <dc:creator>Carmona Mejías, Ángeles</dc:creator>
   <dc:creator>Encinas Bachiller, Andrés Marcos</dc:creator>
   <dc:creator>Mitjana Riera, Margarida</dc:creator>
   <dc:contributor>Universitat Politècnica de Catalunya. Departament de Matemàtiques</dc:contributor>
   <dc:contributor>Universitat Politècnica de Catalunya. COMPTHE - Combinatòria i Teoria Discreta del Potencial pel control de paràmetres en xarxes</dc:contributor>
   <dc:subject>Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta</dc:subject>
   <dc:subject>Graph theory</dc:subject>
   <dc:subject>Eff ective resistances</dc:subject>
   <dc:subject>resistance distances</dc:subject>
   <dc:subject>Schrodinger operator</dc:subject>
   <dc:subject>symmetric M-matrices.</dc:subject>
   <dc:subject>Grafs, Teoria de</dc:subject>
   <dc:subject>Classificació AMS::05 Combinatorics::05C Graph theory</dc:subject>
   <dc:description>This 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 set; that is, the effective resistance distance associated with an irreducible and symmetric M-matrix whose lowest eigenvalue is the parameter and the weight function is the associated eigenfunction. The main idea is to consider the network embedded in a host network with additional edges whose conductances are given in terms of the mentioned parameter. The novelty of these distances is that they take into account not only the influence of shortest and longest weighted paths but also the importance of the vertices. Finally, we prove that the adjusted forest metric introduced by P. Chebotarev and E. Shamis is nothing else but a distance associated with a Schr odinger operator with&#xd;
constant weight</dc:description>
   <dc:description>Peer Reviewed</dc:description>
   <dc:description>Postprint (author's final draft)</dc:description>
   <dc:date>2017</dc:date>
   <dc:type>Article</dc:type>
   <dc:identifier>Carmona, A., Encinas, A., Mitjana, M. Resistance distances on networks. "Applicable analysis and discrete mathematics", 2017, vol. 11, núm. 1, p. 136-147.</dc:identifier>
   <dc:identifier>1452-8630</dc:identifier>
   <dc:identifier>https://hdl.handle.net/2117/105199</dc:identifier>
   <dc:identifier>10.2298/AADM1701136C</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>http://www.doiserbia.nb.rs/Article.aspx?ID=1452-86301701136C&amp;AspxAutoDetectCookieSupport=1</dc:relation>
   <dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights>
   <dc:rights>Open Access</dc:rights>
   <dc:rights>Attribution-NonCommercial-NoDerivs 3.0 Spain</dc:rights>
   <dc:format>12 p.</dc:format>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>