{"title":"子图中心性的新结果和开放问题","authors":"N.Ph. Deniskin, M. Benzi","doi":"10.4310/JOC.2023.v14.n4.a2","DOIUrl":null,"url":null,"abstract":"Subgraph centrality, introduced by Estrada and Rodr\\'iguez-Vel\\'azquez in [12], has become a widely used centrality measure in the analysis of networks, with applications in biology, neuroscience, economics and many other fields. It is also worthy of study from a strictly mathematical point of view, in view of its connections to topics in spectral graph theory, number theory, analytic matrix functions, and combinatorics. In this paper we present some new results and a list of open questions about subgraph centrality and other node centrality measures based on graph walks.","PeriodicalId":44683,"journal":{"name":"Journal of Combinatorics","volume":"32 1","pages":""},"PeriodicalIF":0.4000,"publicationDate":"2021-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New results and open problems on subgraph centrality\",\"authors\":\"N.Ph. Deniskin, M. Benzi\",\"doi\":\"10.4310/JOC.2023.v14.n4.a2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Subgraph centrality, introduced by Estrada and Rodr\\\\'iguez-Vel\\\\'azquez in [12], has become a widely used centrality measure in the analysis of networks, with applications in biology, neuroscience, economics and many other fields. It is also worthy of study from a strictly mathematical point of view, in view of its connections to topics in spectral graph theory, number theory, analytic matrix functions, and combinatorics. In this paper we present some new results and a list of open questions about subgraph centrality and other node centrality measures based on graph walks.\",\"PeriodicalId\":44683,\"journal\":{\"name\":\"Journal of Combinatorics\",\"volume\":\"32 1\",\"pages\":\"\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4310/JOC.2023.v14.n4.a2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4310/JOC.2023.v14.n4.a2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
New results and open problems on subgraph centrality
Subgraph centrality, introduced by Estrada and Rodr\'iguez-Vel\'azquez in [12], has become a widely used centrality measure in the analysis of networks, with applications in biology, neuroscience, economics and many other fields. It is also worthy of study from a strictly mathematical point of view, in view of its connections to topics in spectral graph theory, number theory, analytic matrix functions, and combinatorics. In this paper we present some new results and a list of open questions about subgraph centrality and other node centrality measures based on graph walks.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
