title: Graph vertices ranking using absolute potentials of electric circuit nodes
metadata.name: dc.contributor.author
metadata.value: Mazalov, Vladimir V.
metadata.lang: -
metadata.name: dc.contributor.author
metadata.value: Khitraya, Vitalia A.
metadata.lang: -
metadata.name: dc.date.accessioned
metadata.value: 2023-08-22T17:22:06Z
metadata.lang: -
metadata.name: dc.date.available
metadata.value: 2023-08-22T17:22:06Z
metadata.lang: -
metadata.name: dc.date.issued
metadata.value: 2023-06
metadata.lang: -
metadata.name: dc.identifier.citation
metadata.value: Mazalov V. V., Khitraya V. A. Graph vertices ranking using absolute potentials of electric circuit nodes. Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes, 2023, vol. 19, iss. 2, pp. 233–250.
metadata.lang: en_GB
metadata.name: dc.identifier.issn
metadata.value: https://doi.org/10.21638/11701/spbu10.2023.209
metadata.lang: -
metadata.name: dc.identifier.uri
metadata.value: http://hdl.handle.net/11701/43831
metadata.lang: -
metadata.name: dc.description.abstract
metadata.value: A method for ranking the vertices of a graph based on Kirchhoff’s laws for determining the potentials of an electrical network is proposed. The graph is represented as an electrical network, where the edge weights are interpreted as electrical conductivities. Next, the current is supplied to one of the vertices, and the absolute potentials of all vertices are determined by the Kirchhoff method. Based on the obtained potential values, the vertices are ranked. Then the current is sequentially applied to all vertices and the ranking is performed each time. For the final ranking, it is proposed to apply the ranking procedure based on the tournament matrix. The operation of the ranking algorithm is illustrated by numerical examples related to graphs of specific transport networks.
metadata.lang: en_GB
metadata.name: dc.description.sponsorship
metadata.value: The study was financially supported by the Russian Science Foundation (grant N 22-11-20015), conducted jointly with the authorities of the Republic of Karelia, and the Venture Investment Fund of the
  Republic of Karelia.
metadata.lang: en_GB
metadata.name: dc.language.iso
metadata.value: ru
metadata.lang: en_GB
metadata.name: dc.publisher
metadata.value: St Petersburg State University
metadata.lang: en_GB
metadata.name: dc.relation.ispartofseries
metadata.value: Vestnik of St Petersburg University. Applied Mathematics. Computer Science. Control Processes;Volume 19; Issue 2
metadata.lang: -
metadata.name: dc.subject
metadata.value: graph
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: centrality measure
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: ranking procedure
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: Kirchhoff’s circuit laws
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: transportation network
metadata.lang: en_GB
metadata.name: dc.subject
metadata.value: electrical circuit model
metadata.lang: en_GB
metadata.name: dc.title
metadata.value: Graph vertices ranking using absolute potentials of electric circuit nodes
metadata.lang: en_GB
metadata.name: dc.type
metadata.value: Article
metadata.lang: en_GB
resources.filename: 09.pdf
resources.url: https://dspace.spbu.ru/bitstream/11701/43831/1/09.pdf
resources.format: Adobe PDF
resources.size: 1,05 MB