{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T11:45:45Z","timestamp":1777722345568,"version":"3.51.4"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ins.2026.123253","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:13:31Z","timestamp":1772784811000},"page":"123253","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The subgraph eigenvector centrality of graphs"],"prefix":"10.1016","volume":"743","author":[{"given":"Qingying","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4706-9318","authenticated-orcid":false,"given":"Lizhu","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjiang","family":"Bu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6794","key":"10.1016\/j.ins.2026.123253_bib0005","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/35019019","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"Albert","year":"2000","journal-title":"Nature"},{"key":"10.1016\/j.ins.2026.123253_bib0010","series-title":"International Workshop on Frontiers in Algorithmics","first-page":"186","article-title":"Ranking of closeness centrality for large-scale social networks","author":"Okamoto","year":"2008"},{"issue":"5","key":"10.1016\/j.ins.2026.123253_bib0015","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.71.056103","article-title":"Subgraph centrality in complex networks","volume":"71","author":"Estrada","year":"2005","journal-title":"Phys. Rev. E"},{"issue":"1","key":"10.1016\/j.ins.2026.123253_bib0020","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"10.1016\/j.ins.2026.123253_bib0025","series-title":"2015 International Conference on Futuristic Trends on Computational Analysis and Knowledge Management (ABLAZE)","first-page":"510","article-title":"Eigenvector centrality and its application in research professionals\u2019 relationship network","author":"Bihari","year":"2015"},{"issue":"4","key":"10.1016\/j.ins.2026.123253_bib0030","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0010232","article-title":"Eigenvector centrality mapping for analyzing connectivity patterns in fMRI data of the human brain","volume":"5","author":"Lohmann","year":"2010","journal-title":"PLoS ONE"},{"key":"10.1016\/j.ins.2026.123253_bib0035","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.ins.2011.11.033","article-title":"Predicting protein complexes in protein interaction networks using a core-attachment algorithm based on graph communicability","volume":"189","author":"Ma","year":"2012","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.ins.2026.123253_bib0040","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1137\/18M1203031","article-title":"Three hypergraph eigenvector centralities","volume":"1","author":"Benson","year":"2019","journal-title":"SIAM J. Math. Data Sci."},{"issue":"2","key":"10.1016\/j.ins.2026.123253_bib0045","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1137\/17M1137668","article-title":"Node and layer eigenvector centralities for multiplex networks","volume":"78","author":"Tudisco","year":"2018","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.ins.2026.123253_bib0050","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.apm.2017.07.012","article-title":"A new centrality measure of nodes in multilayer networks under the framework of tensor computation","volume":"54","author":"Wang","year":"2018","journal-title":"Appl. Math. Model."},{"issue":"1","key":"10.1016\/j.ins.2026.123253_bib0055","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/S0036144503424786","article-title":"A survey of eigenvector methods for web information retrieval","volume":"47","author":"Langville","year":"2005","journal-title":"SIAM Rev."},{"key":"10.1016\/j.ins.2026.123253_bib0060","series-title":"Matrix Analysis and Applied Linear Algebra","author":"Meyer","year":"2023"},{"key":"10.1016\/j.ins.2026.123253_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2023.113753","article-title":"The two-steps eigenvector centrality in complex networks","volume":"173","author":"Xu","year":"2023","journal-title":"Chaos, Solitons and Fractals"},{"key":"10.1016\/j.ins.2026.123253_bib0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2024.115675","article-title":"Identifying influential nodes in social networks via improved Laplacian centrality","volume":"189","author":"Zhu","year":"2024","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.ins.2026.123253_bib0075","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ins.2021.01.053","article-title":"Identifying influential nodes in complex networks: effective distance gravity model","volume":"577","author":"Shang","year":"2021","journal-title":"Inf. Sci."},{"issue":"9","key":"10.1016\/j.ins.2026.123253_bib0080","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3685677","article-title":"Triangle centrality","volume":"18","author":"Burkhardt","year":"2024","journal-title":"ACM Trans. Knowl. Discov. Data"},{"issue":"5","key":"10.1016\/j.ins.2026.123253_bib0085","first-page":"2179","article-title":"Ranking users in social networks with motif-based pagerank","volume":"33","author":"Zhao","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123253_bib0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.comnet.2024.110200","article-title":"Quantifying the importance of specific types of higher-order structures in complex networks","volume":"241","author":"Song","year":"2024","journal-title":"Comput. Netw."},{"key":"10.1016\/j.ins.2026.123253_bib0095","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.dam.2023.10.017","article-title":"Ranking trees based on global centrality measures","volume":"343","author":"Barghi","year":"2024","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.ins.2026.123253_bib0100","first-page":"123","article-title":"On the spectrum, automorphism group and divisors of a graph","volume":"15","author":"Petersdorf","year":"1969","journal-title":"Sci. J. Ilmenau Tech. Univ."},{"issue":"14","key":"10.1016\/j.ins.2026.123253_bib0105","doi-asserted-by":"crossref","first-page":"2354","DOI":"10.1080\/03081087.2022.2103490","article-title":"The high order spectrum of a graph and its applications in graph colouring and clique counting","volume":"71","author":"Liu","year":"2023","journal-title":"Linear Multilinear Algebra"},{"issue":"2","key":"10.1016\/j.ins.2026.123253_bib0110","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/s10878-023-01081-y","article-title":"On a generalization of the spectral mantel\u2019s theorem","volume":"46","author":"Liu","year":"2023","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.ins.2026.123253_bib0115","series-title":"1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","first-page":"129","article-title":"Singular values and eigenvalues of tensors: a variational approach","author":"Lim","year":"2005"},{"issue":"6","key":"10.1016\/j.ins.2026.123253_bib0120","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1016\/j.jsc.2005.05.007","article-title":"Eigenvalues of a real supersymmetric tensor","volume":"40","author":"Qi","year":"2005","journal-title":"J. Symb. Comput."},{"issue":"9","key":"10.1016\/j.ins.2026.123253_bib0125","doi-asserted-by":"crossref","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","article-title":"Spectra of uniform hypergraphs","volume":"436","author":"Cooper","year":"2012","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.ins.2026.123253_bib0130","series-title":"Tensor Analysis: Spectral Theory and Special Tensors","author":"Qi","year":"2017"},{"key":"10.1016\/j.ins.2026.123253_bib0135","article-title":"A statistical model for tensor PCA","volume":"27","author":"Montanari","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123253_bib0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121210","article-title":"A novel multi-modal incremental tensor decomposition for anomaly detection in large-scale networks","volume":"681","author":"Fan","year":"2024","journal-title":"Inf. Sci."},{"issue":"6","key":"10.1016\/j.ins.2026.123253_bib0145","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.122.065301","article-title":"Quantum entanglement in deep learning architectures","volume":"122","author":"Levine","year":"2019","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/j.ins.2026.123253_bib0150","series-title":"Generalized Continua as Models for Classical and Advanced Materials","first-page":"279","article-title":"Eigenvalue problems of a tensor and a tensor-block matrix (tmb) of any even rank with some applications in mechanics","author":"Nikabadze","year":"2016"},{"issue":"2","key":"10.1016\/j.ins.2026.123253_bib0155","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.laa.2011.02.042","article-title":"Perron\u2013frobenius theorem for nonnegative multilinear forms and extensions","volume":"438","author":"Friedland","year":"2013","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"10.1016\/j.ins.2026.123253_bib0160","doi-asserted-by":"crossref","first-page":"2517","DOI":"10.1137\/090778766","article-title":"Further results for perron\u2013frobenius theorem for nonnegative tensors","volume":"31","author":"Yang","year":"2010","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10.1016\/j.ins.2026.123253_bib0165","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0378-8733(91)90017-N","article-title":"Centrality in valued graphs: a measure of betweenness based on network flow","volume":"13","author":"Freeman","year":"1991","journal-title":"Social networks"},{"key":"10.1016\/j.ins.2026.123253_bib0170","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.apnum.2021.10.005","article-title":"Communication in complex networks","volume":"172","author":"De la Cruz Cabrera","year":"2022","journal-title":"Appl. Numer. Math."},{"key":"10.1016\/j.ins.2026.123253_bib0175","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.physa.2017.04.037","article-title":"Eb&d: a new clustering approach for signed social networks based on both edge-betweenness centrality and density of subgraphs","volume":"482","author":"Qi","year":"2017","journal-title":"Phys. A"},{"key":"10.1016\/j.ins.2026.123253_bib0180","series-title":"2017 2nd International Conference on Modelling, Simulation and Applied Mathematics (MSAM2017)","first-page":"300","article-title":"Degree centrality, betweenness centrality, and closeness centrality in social network","author":"Zhang","year":"2017"},{"key":"10.1016\/j.ins.2026.123253_bib0185","series-title":"Proceedings of the 2015 SIAM International Conference on Data Mining","first-page":"118","article-title":"Tensor spectral clustering for partitioning higher-order network structures","author":"Benson","year":"2015"},{"key":"10.1016\/j.ins.2026.123253_bib0190","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s11464-012-0268-4","article-title":"Efficient algorithms for computing the largest eigenvalue of a nonnegative tensor","volume":"8","author":"Zhou","year":"2013","journal-title":"Front. Math. China"},{"issue":"1","key":"10.1016\/j.ins.2026.123253_bib0195","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.21834","article-title":"Detecting critical node structures on graphs: a mathematical programming approach","volume":"73","author":"Walteros","year":"2019","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ins.2026.123253_bib0200","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3649134","article-title":"A family of centrality measures for graph data based on subgraphs","volume":"49","author":"Bugedo","year":"2024","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"10.1016\/j.ins.2026.123253_bib0205","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","article-title":"An information flow model for conflict and fission in small groups","volume":"33","author":"Zachary","year":"1977","journal-title":"J. Anthropol. Res."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526001842?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526001842?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:34:33Z","timestamp":1777458873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526001842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":41,"alternative-id":["S0020025526001842"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123253","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The subgraph eigenvector centrality of graphs","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123253","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123253"}}