{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:08:52Z","timestamp":1740103732349,"version":"3.37.3"},"reference-count":36,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,12,3]],"date-time":"2020-12-03T00:00:00Z","timestamp":1606953600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861019","KY[2018]046","[2019]1047","[2020]1Z001"],"award-info":[{"award-number":["11861019","KY[2018]046","[2019]1047","[2020]1Z001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guizhou Tal-ent Development Project in Science and Technology","award":["11861019","KY[2018]046","[2019]1047","[2020]1Z001"],"award-info":[{"award-number":["11861019","KY[2018]046","[2019]1047","[2020]1Z001"]}]},{"DOI":"10.13039\/501100005329","name":"Natural Science Foundation of Guizhou Province","doi-asserted-by":"publisher","award":["11861019","KY[2018]046","[2019]1047","[2020]1Z001"],"award-info":[{"award-number":["11861019","KY[2018]046","[2019]1047","[2020]1Z001"]}],"id":[{"id":"10.13039\/501100005329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2020,12,3]]},"abstract":"<jats:p>Network similarity measures have proven essential in the field of network analysis. Also, topological indices have been used to quantify the topology of networks and have been well studied. In this paper, we employ a new topological index which we call the Ediz eccentric connectivity index. We use this quantity to define network similarity measures as well. First, we determine the extremal value of the Ediz eccentric connectivity index on some network classes. Second, we compare the network similarity measure based on the Ediz eccentric connectivity index with other well-known topological indices such as Wiener index, graph energy, Randi\u0107 index, the largest eigenvalue, the largest Laplacian eigenvalue, and connectivity eccentric index. Numerical results underpin the usefulness of the chosen measures. They show that our new measure outperforms all others, except the one based on Wiener index. This means that the measure based on Wiener index is still the best, but the new one has certain advantage to some extent.<\/jats:p>","DOI":"10.1155\/2020\/2567570","type":"journal-article","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T01:35:08Z","timestamp":1607045708000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["Network Similarity Measure and Ediz Eccentric Connectivity Index"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3616-5344","authenticated-orcid":true,"given":"Guihai","family":"Yu","sequence":"first","affiliation":[{"name":"College of Big Data Statistics, Guizhou University of Finance and Economics, Guiyang, Guizhou 550025, China"}]},{"given":"Xinzhuang","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Northwestern Polytechnical University, Xi\u2019an, Shaanxi 710072, China"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2015.05.072"},{"key":"2","unstructured":"Sch\u00e4dlerC.Die ermittlung struktureller \u00e4hnlichkeit und struktureller merkmale bei komplexen objekten: Ein konnektionistischer ansatz ynd seine anwendungen1999Berlin, GermanyTechnische Universit\u00e4tPh.D. thesis"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0094985"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.02.024"},{"key":"5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.ins.2016.01.074","article-title":"Fifty years of graph matching, network alignment and comparison","volume":"346-347","author":"F. Emmert-Streib","year":"2016","journal-title":"Information Sciences"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.03.036"},{"issue":"11","key":"7","first-page":"1263","article-title":"On the Ediz eccentric connectivity index of a graph","volume":"5","author":"S. Ediz","year":"2011","journal-title":"Optoelectronics and Advanced Materials-Rapid Communications"},{"volume-title":"Handbook of Molecular Descriptors","year":"2002","author":"R. Todeschini","key":"8"},{"key":"9","doi-asserted-by":"crossref","DOI":"10.1002\/9783527645121","volume-title":"Statistical Modeling of Molecular Descriptors in QSAR\/QSPR, Quantitiative and Network Biology","author":"M. Dehmer","year":"2012"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/s0097-8485(01)00073-0"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1049\/iet-syb.2010.0025"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44485-5_9"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2007.06.029"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1021\/ja01193a005"},{"key":"15","first-page":"111","article-title":"Metric-ectremal graphs","volume-title":"Quantitative Graph Theory-Mathematical Foundations and Applications","author":"I. Gutman","year":"2015"},{"key":"16","first-page":"3","article-title":"Symmetry-moderated wiener index","volume":"76","author":"H. Shabani","year":"2017","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1021\/ja00856a001"},{"issue":"1","key":"18","first-page":"85","article-title":"From the connectivity index to various Randi\u0107-type descriptors","volume":"80","author":"Y. Ma","year":"2018","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"19","doi-asserted-by":"crossref","DOI":"10.1201\/b19046","volume-title":"Solved and Unsolved Problems of Structural Chemistry","author":"M. Randi\u0107","year":"2016"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/bf00552542"},{"key":"21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-4220-2","volume-title":"Graph Energy","author":"X. Li","year":"2012"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/s1093-3263(00)00027-9"},{"key":"23","first-page":"611","article-title":"On the connective eccentricity index of graphs","volume":"69","author":"G. Yu","year":"2013","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1515\/phys-2017-0039"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.24297\/jac.v2i1.910"},{"key":"26","first-page":"613","article-title":"On vertex-degree-based molecular structure descriptors","volume":"66","author":"T. Do\u0161li\u0107","year":"2011","journal-title":"MATCH Communications in Mathematical and in Computer Chemistry"},{"key":"27","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/j.jmaa.2011.02.086","article-title":"On the eccentric distance sum of graphs","volume":"381","author":"A. Ili\u0107","year":"2011","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"28","article-title":"Graph theory","volume-title":"Graduate Texts in Mathematics","author":"J. A. Bondy","year":"2008"},{"volume-title":"An Atlas of Graphs","year":"1998","author":"R. R. Wilson","key":"29"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.02.003"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.08.010"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.10.006"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.08.025"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2014.09.029"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.02.069"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.2298\/fil1613451x"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2567570.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2567570.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2020\/2567570.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T01:35:18Z","timestamp":1607045718000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2020\/2567570\/"}},"subtitle":[],"editor":[{"given":"Vincent","family":"Labatut","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2020,12,3]]},"references-count":36,"alternative-id":["2567570","2567570"],"URL":"https:\/\/doi.org\/10.1155\/2020\/2567570","relation":{},"ISSN":["1099-0526","1076-2787"],"issn-type":[{"type":"electronic","value":"1099-0526"},{"type":"print","value":"1076-2787"}],"subject":[],"published":{"date-parts":[[2020,12,3]]}}}