{"title":"Graph vertices ranking using absolute potentials of electric circuit nodes","authors":"V. Mazalov, V. Khitraya","doi":"10.21638/11701/spbu10.2023.209","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"23 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21638/11701/spbu10.2023.209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍：
The journal is the prime outlet for the findings of scientists from the Faculty of applied mathematics and control processes of St. Petersburg State University. It publishes original contributions in all areas of applied mathematics, computer science and control. Vestnik St. Petersburg University: Applied Mathematics. Computer Science. Control Processes features articles that cover the major areas of applied mathematics, computer science and control.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
