{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T07:29:08Z","timestamp":1773646148941,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T00:00:00Z","timestamp":1538352000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"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":[[2018,10]]},"DOI":"10.1016\/j.ins.2018.07.072","type":"journal-article","created":{"date-parts":[[2018,8,3]],"date-time":"2018-08-03T22:49:09Z","timestamp":1533336549000},"page":"407-414","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Graph measures with high discrimination power revisited: A random polynomial approach"],"prefix":"10.1016","volume":"467","author":[{"given":"Matthias","family":"Dehmer","sequence":"first","affiliation":[]},{"given":"Zengqiang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Shailesh","family":"Tripathi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2018.07.072_bib0001","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0009-2614(82)80009-2","article-title":"Highly discriminating distance-based topological index","volume":"89","author":"Balaban","year":"1982","journal-title":"Chem. Phys. Lett."},{"key":"10.1016\/j.ins.2018.07.072_bib0002","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01166951","article-title":"New vertex invariants and topological indices of chemical graphs based on information on distances","volume":"8","author":"Balaban","year":"1991","journal-title":"J. Math. Chem."},{"key":"10.1016\/j.ins.2018.07.072_bib0003","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1021\/c160043a020","article-title":"The characteristic polynomial does not uniquely determine the topology of a molecule","volume":"11","author":"Balaban","year":"1971","journal-title":"J. Chem. Doc."},{"issue":"2","key":"10.1016\/j.ins.2018.07.072_bib0004","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/jcc.540020202","article-title":"Isomer discrimination by topological information approach","volume":"2","author":"Bonchev","year":"1981","journal-title":"J. Comp. Chem."},{"key":"10.1016\/j.ins.2018.07.072_bib0005","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/jgt.20146","article-title":"Roots of cube polynomials of median graphs","volume":"52","author":"Bre\u0161ar","year":"2006","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ins.2018.07.072_sbref0006","series-title":"Spectra of Graphs. Theory and Application","author":"Cvetkovi\u0107","year":"1980"},{"key":"10.1016\/j.ins.2018.07.072_bib0007","first-page":"82","article-title":"Information processing in complex networks: graph entropy and information functionals","volume":"201","author":"Dehmer","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2018.07.072_bib0008","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ins.2013.11.008","article-title":"A computational approach to construct a multivariate complete graph invariant","volume":"260","author":"Dehmer","year":"2014","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2018.07.072_bib0009","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.ins.2017.04.041","article-title":"Highly unique network descriptors based on the roots of the permanental polynomial","volume":"408","author":"Dehmer","year":"2017","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2018.07.072_bib0010","series-title":"Quantum Frontiers of Atoms and Molecules","first-page":"479","article-title":"Quantifying structural complexity of graphs: Information measures in mathematical chemistry","author":"Dehmer","year":"2011"},{"key":"10.1016\/j.ins.2018.07.072_bib0011","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10444-012-9281-0","article-title":"An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants","volume":"39","author":"Dehmer","year":"2012","journal-title":"Adv. Comput. Math."},{"key":"10.1016\/j.ins.2018.07.072_bib0012","doi-asserted-by":"crossref","first-page":"e31214","DOI":"10.1371\/journal.pone.0031214","article-title":"Information indices with high discriminative power for graphs","volume":"7","author":"Dehmer","year":"2012","journal-title":"PLoS ONE"},{"key":"10.1016\/j.ins.2018.07.072_bib0013","doi-asserted-by":"crossref","first-page":"e28328","DOI":"10.1371\/journal.pone.0028328","article-title":"Location of zeros of wiener and distance polynomials","volume":"7","author":"Dehmer","year":"2012","journal-title":"PLoS ONE"},{"key":"10.1016\/j.ins.2018.07.072_bib0014","first-page":"164","article-title":"Encoding structural information uniquely with polynomial-based descriptors by employing the randi\u0107 matrix","volume":"268","author":"Dehmer","year":"2015","journal-title":"Appl. Math. Comput. accepted"},{"key":"10.1016\/j.ins.2018.07.072_bib0015","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","article-title":"A history of graph entropy measures","volume":"1","author":"Dehmer","year":"2011","journal-title":"Inf. Sci."},{"issue":"7","key":"10.1016\/j.ins.2018.07.072_bib0016","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0011393","article-title":"New polynomial-based molecular descriptors with low degeneracy","volume":"5","author":"Dehmer","year":"2010","journal-title":"PLoS ONE"},{"key":"10.1016\/j.ins.2018.07.072_bib0017","doi-asserted-by":"crossref","first-page":"e102459","DOI":"10.1371\/journal.pone.0102459","article-title":"Structural differentiation of graphs using hosoya-based indices","volume":"9","author":"Dehmer","year":"2014","journal-title":"PLoS ONE"},{"key":"10.1016\/j.ins.2018.07.072_bib0018","first-page":"352","article-title":"Discrimination power of graph measures based on complex zeros of the partial hosoya polynomial","volume":"250","author":"Dehmer","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2018.07.072_bib0019","series-title":"Chromatic Polynomials and Chromaticity of Graphs","author":"Dong","year":"2005"},{"key":"10.1016\/j.ins.2018.07.072_bib0020","series-title":"Structural Analysis of Complex Networks","first-page":"219","article-title":"Graph polynomials and their applications i: The tutte polynomial","author":"Ellis-Monaghan","year":"2010"},{"issue":"1","key":"10.1016\/j.ins.2018.07.072_bib0021","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1112\/plms\/s3-6.1.139","article-title":"On the number of real roots of a random algebraic equation","volume":"s3-6","author":"Erd\u00f6s","year":"1956","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"10.1016\/j.ins.2018.07.072_bib0022","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/1969500","article-title":"On the distribution of roots of polynomials","volume":"51","author":"Erd\u00f6s","year":"1950","journal-title":"Ann. Math."},{"key":"10.1016\/j.ins.2018.07.072_bib0023","series-title":"Chemical Graph Theory. Introduction and Fundamentals","first-page":"133","article-title":"Polynomials in graph theory","author":"Gutman","year":"1991"},{"key":"10.1016\/j.ins.2018.07.072_bib0024","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(88)90017-0","article-title":"On some counting polynomials","volume":"19","author":"Hosoya","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ins.2018.07.072_bib0025","series-title":"The Numerical Treatment of a single Nonlinear Equation","author":"Householder","year":"1970"},{"key":"10.1016\/j.ins.2018.07.072_bib0026","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1021\/ci9501150","article-title":"On highly discriminating molecular topological index","volume":"36","author":"Hu","year":"1996","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"10.1016\/j.ins.2018.07.072_bib0027","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00022-003-1694-y","article-title":"Zeros of chromatic and flow polynomials of graphs","volume":"76","author":"Jackson","year":"2003","journal-title":"J. Geometry"},{"key":"10.1016\/j.ins.2018.07.072_bib0028","series-title":"Mathematical Chemistry Monographs. University of Kragujevac and Faculty of Science Kragujevac","article-title":"Graph-theoretical matrices in chemistry","author":"Jane\u017ei\u0107","year":"2007"},{"issue":"2","key":"10.1016\/j.ins.2018.07.072_sbref0029","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/361254.361262","article-title":"Algorithm 419: Zeros of a complex polynomial [c2]","volume":"15","author":"Jenkins","year":"1972","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ins.2018.07.072_bib0030","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1021\/ci9502461","article-title":"The discrimination ability of some topological and information distance indices for graphs of unbranched hexagonal systems","volume":"36","author":"Konstantinova","year":"1996","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"10.1016\/j.ins.2018.07.072_bib0031","series-title":"General Theory of Information Transfer and Combinatorics, Lecture Notes of Computer Science","first-page":"831","article-title":"On some applications of information indices in chemical graph theory","author":"Konstantinova","year":"2006"},{"key":"10.1016\/j.ins.2018.07.072_sbref0032","first-page":"38","article-title":"Sensitivity of topological indices of polycyclic graphs","volume":"136","author":"Konstantinova","year":"1990","journal-title":"Vychisl. Sistemy"},{"key":"10.1016\/j.ins.2018.07.072_bib0033","doi-asserted-by":"crossref","first-page":"357","DOI":"10.21136\/AM.1983.104047","article-title":"On the distance polynomial of a graph","volume":"28","author":"K\u0159ivka","year":"1983","journal-title":"Appl. Math."},{"key":"10.1016\/j.ins.2018.07.072_bib0034","series-title":"Graph Energy","author":"Li","year":"2012"},{"key":"10.1016\/j.ins.2018.07.072_bib0035","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1112\/jlms\/s1-13.4.288","article-title":"On the number of real roots of a random algebraic equation","volume":"13","author":"Littlewood","year":"1938","journal-title":"J. London Math. Soc."},{"issue":"10","key":"10.1016\/j.ins.2018.07.072_bib0036","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1002\/jcc.540121012","article-title":"The graph isomorphism problem","volume":"12","author":"Liu","year":"1991","journal-title":"J. Comput. Chem."},{"key":"10.1016\/j.ins.2018.07.072_bib0037","unstructured":"B.D. McKay, Nauty, 2010, http:\/\/cs.anu.edu.au\/~bdm\/nauty\/."},{"key":"10.1016\/j.ins.2018.07.072_bib0038","series-title":"Discrete Mathematics and Theoretical Computer Science","article-title":"Polynomials: An algorithmic approach","author":"Mignotte","year":"1999"},{"issue":"1","key":"10.1016\/j.ins.2018.07.072_bib0039","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1093\/bioinformatics\/btq606","article-title":"QuACN - an r package for analyzing complex biological networks quantitatively","volume":"27","author":"M\u00fcller","year":"2011","journal-title":"Bioinformatics"},{"key":"10.1016\/j.ins.2018.07.072_bib0040","unstructured":"L.A.J. M\u00fcller, M. Schutte, K.G. Kugler, M. Dehmer, QuACN: Quantitative analyze of complex networks, 2012, R Package Version 1.6."},{"issue":"C","key":"10.1016\/j.ins.2018.07.072_sbref0039","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.jat.2014.09.003","article-title":"Zeros of polynomials with random coefficients","volume":"189","author":"Pritsker","year":"2015","journal-title":"J. Approx. Theory"},{"key":"10.1016\/j.ins.2018.07.072_sbref0040","article-title":"R: A language and environment for statistical computing","author":"Team","year":"2016","journal-title":"R Found. Stat. Comput."},{"issue":"3","key":"10.1016\/j.ins.2018.07.072_bib0043","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1021\/ci00043a009","article-title":"On molecular identification numbers","volume":"24","author":"Randi\u0107","year":"1984","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"10.1016\/j.ins.2018.07.072_bib0044","series-title":"QSPR\/QSAR Studies by Molecular Descriptors","first-page":"93","article-title":"Eigenvalues as molecular descriptors","author":"Randi\u0107","year":"2001"},{"key":"10.1016\/j.ins.2018.07.072_bib0045","series-title":"Graph Polynomials","author":"Shi","year":"2017"},{"key":"10.1016\/j.ins.2018.07.072_bib0046","series-title":"Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica","first-page":"181","article-title":"Graph isomorphism","author":"Skiena","year":"1990"},{"key":"10.1016\/j.ins.2018.07.072_bib0047","doi-asserted-by":"crossref","first-page":"2012","DOI":"10.1021\/ja00896a022","article-title":"The atom connectivity matrix (acm) and its characteristic polynomial (acmcp): A new computer-oriented chemical nomenclature","volume":"85","author":"Spialter","year":"1963","journal-title":"J. Am. Chem. Soc."},{"key":"10.1016\/j.ins.2018.07.072_sbref0046","first-page":"199","article-title":"The global graph as a complete topological invariant in the class of diffeomorphisms on M3","volume":"11","author":"Talanova","year":"2009","journal-title":"Trudy Srednevolzhskogo Matematicheskogo Obshchestva"},{"key":"10.1016\/j.ins.2018.07.072_bib0049","series-title":"Handbook of Molecular Descriptors","author":"Todeschini","year":"2002"},{"key":"10.1016\/j.ins.2018.07.072_bib0050","series-title":"Graph Polynomials","article-title":"On the permanental polynomials of graphs","author":"Wu","year":"2017"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002551830598X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002551830598X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:39:29Z","timestamp":1762177169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002551830598X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":50,"alternative-id":["S002002551830598X"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2018.07.072","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2018,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph measures with high discrimination power revisited: A random polynomial approach","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2018.07.072","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}