{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T14:04:53Z","timestamp":1780322693963,"version":"3.54.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:00:00Z","timestamp":1704844800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T00:00:00Z","timestamp":1704844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["(PID2019- 107603GB-I00"],"award-info":[{"award-number":["(PID2019- 107603GB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["CEX2021-001164-M"],"award-info":[{"award-number":["CEX2021-001164-M"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100014370","name":"Instituto de F\u00edsica Interdisciplinar y Sistemas Complejos","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100014370","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A distance based on the exponential kernel of the adjacency matrix of a graph and representing how well two vertices connect to each other in a graph is defined and studied. This communicability cosine distance (CCD) is a Euclidean spherical distance accounting for the cosine of the angles spanned by the position vectors of the graph vertices in this space. The Euclidean distance matrix (EDM) of CCD is used to quantify the similarity between vertices in graphs and networks as well as to define a local vertex invariant\u2014a closeness centrality measure, which discriminate very well vertices in small graphs. It allows to distinguish all nonidentical vertices, also characterizing all identity (asymmetric) graphs\u2013those having only the identity automorphism\u2013among all connected graphs of up to 9 vertices. It also characterizes several other classes of identity graphs. We also study real-world networks in term of both the discriminating power of the new centrality on their vertices as well as in ranking their vertices. We analyze some dictionary networks as well as the network of copurshasing of political books, remarking some of the main advantages of the new approaches studied here.<\/jats:p>","DOI":"10.1007\/s40314-023-02571-9","type":"journal-article","created":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T19:01:55Z","timestamp":1704913315000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Communicability cosine distance: similarity and symmetry in graphs\/networks"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3066-7418","authenticated-orcid":false,"given":"Ernesto","family":"Estrada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,10]]},"reference":[{"issue":"6","key":"2571_CR1","doi-asserted-by":"crossref","first-page":"1611","DOI":"10.1109\/TAC.2014.2381435","volume":"60","author":"CO Aguilar","year":"2014","unstructured":"Aguilar CO, Gharesifard B (2014) Graph controllability classes for the Laplacian leader\u2013follower dynamics. IEEE Trans Autom Control 60(6):1611\u20131623","journal-title":"IEEE Trans Autom Control"},{"issue":"1","key":"2571_CR2","doi-asserted-by":"crossref","first-page":"R18","DOI":"10.37236\/1242","volume":"3","author":"MO Albertson","year":"1996","unstructured":"Albertson MO, Collins KL (1996) Symmetry breaking in graphs. Electr J Comb 3(1):R18","journal-title":"Electr J Comb"},{"issue":"1","key":"2571_CR3","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.laa.2005.10.001","volume":"414","author":"AY Alfakih","year":"2006","unstructured":"Alfakih AY (2006) A remark on the faces of the cone of Euclidean distance matrices. Linear Algebra Appl 414(1):266\u2013270","journal-title":"Linear Algebra Appl"},{"issue":"11","key":"2571_CR4","doi-asserted-by":"crossref","first-page":"12583","DOI":"10.1109\/TCYB.2021.3069839","volume":"52","author":"Q Bao","year":"2021","unstructured":"Bao Q, Zhang Z (2021) Discriminating power of centrality measures in complex networks. IEEE Trans Cybern 52(11):12583\u201312593","journal-title":"IEEE Trans Cybern"},{"issue":"1\u20132","key":"2571_CR5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0378-8733(92)90016-Z","volume":"14","author":"V Batagelj","year":"1992","unstructured":"Batagelj V, Doreian P, Ferligoj A (1992) An optimizational approach to regular equivalence. Soc Netw 14(1\u20132):121\u2013135","journal-title":"Soc Netw"},{"key":"2571_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.17730\/humo.7.3.f4033344851gl053","volume":"7","author":"A Bavelas","year":"1948","unstructured":"Bavelas A (1948) A mathematical model for group structures. Hum Organ 7:16\u201330","journal-title":"Hum Organ"},{"issue":"4","key":"2571_CR7","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0036144502415960","volume":"46","author":"VD Blondel","year":"2004","unstructured":"Blondel VD, Gajardo A, Heymans M, Senellart P, Van Dooren P (2004) A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev 46(4):647\u2013666","journal-title":"SIAM Rev"},{"issue":"4","key":"2571_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0378-8733(93)90012-A","volume":"15","author":"SP Borgatti","year":"1993","unstructured":"Borgatti SP, Everett MG (1993) Two algorithms for computing regular equivalence. Soc Netw 15(4):361\u2013376","journal-title":"Soc Netw"},{"issue":"3","key":"2571_CR9","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.socnet.2013.05.003","volume":"35","author":"E Bozzo","year":"2013","unstructured":"Bozzo E, Franceschet M (2013) Resistance distance, closeness, and betweenness. Soc Netw 35(3):460\u2013469","journal-title":"Soc Netw"},{"key":"2571_CR10","volume-title":"A course in metric geometry","author":"D Burago","year":"2022","unstructured":"Burago D, Burago Y, Ivanov S (2022) A course in metric geometry, vol 33. American Mathematical Society, Providence"},{"key":"2571_CR11","first-page":"137","volume":"102","author":"PJ Cameron","year":"2004","unstructured":"Cameron PJ, Mary Q (2004) Automorphisms of graphs. Top Algebr Graph Theory 102:137\u2013155","journal-title":"Top Algebr Graph Theory"},{"key":"2571_CR12","doi-asserted-by":"crossref","unstructured":"Chan A, Godsil CD(1997) Symmetry and eigenvectors. In: Hahn G, Sabidussi G (eds) Graph symmetry: algebraic methods and applications. Springer, Dordrecht, pp 75\u2013106","DOI":"10.1007\/978-94-015-8937-6_3"},{"key":"2571_CR13","doi-asserted-by":"crossref","unstructured":"Chen D, Su Cai D, H, (2023) Self-similarity of complex networks under centrality-based node removal strategy. Chin Phys B 32:098903","DOI":"10.1088\/1674-1056\/acd3e2"},{"key":"2571_CR14","unstructured":"Cvetkovi\u0107 D, Rowlinson P, Stani\u0107 Z, Yoon MG (2011) Controllable graphs. Bulletin (Acad\u00e9mie serbe des sciences et des arts. Classe des sciences math\u00e9matiques et naturelles. Sciences math\u00e9matiques), 81\u201388"},{"issue":"7","key":"2571_CR15","first-page":"329","volume":"94","author":"RR Dipert","year":"1997","unstructured":"Dipert RR (1997) The mathematical structure of the world: the world as graph. J Philos 94(7):329\u2013358","journal-title":"J Philos"},{"key":"2571_CR16","volume-title":"The structure of complex networks: theory and applications","author":"E Estrada","year":"2012","unstructured":"Estrada E (2012a) The structure of complex networks: theory and applications. Oxford University Press, Oxford"},{"issue":"11","key":"2571_CR17","doi-asserted-by":"crossref","first-page":"4317","DOI":"10.1016\/j.laa.2012.01.017","volume":"436","author":"E Estrada","year":"2012","unstructured":"Estrada E (2012b) The communicability distance in graphs. Linear Algebra Appl 436(11):4317\u20134328","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"2571_CR18","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s40324-021-00275-w","volume":"79","author":"E Estrada","year":"2022","unstructured":"Estrada E (2022) The many facets of the Estrada indices of graphs and networks. SeMA J 79(1):57\u2013125","journal-title":"SeMA J"},{"key":"2571_CR19","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.laa.2022.09.025","volume":"656","author":"E Estrada","year":"2023","unstructured":"Estrada E (2023) Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix. Linear Algebra Appl 656:198\u2013209","journal-title":"Linear Algebra Appl"},{"key":"2571_CR20","volume-title":"The target problem","author":"E Estrada","year":"2024","unstructured":"Estrada E (2024) Conservative vs. non-conservative diffusion towards a target in a networked environment. In: Grebenkov D, Metzler R, Oshanin G (eds) The target problem. Springer, Berlin"},{"issue":"3","key":"2571_CR21","doi-asserted-by":"crossref","first-page":"036111","DOI":"10.1103\/PhysRevE.77.036111","volume":"77","author":"E Estrada","year":"2008","unstructured":"Estrada E, Hatano N (2008) Communicability in complex networks. Phys Rev E 77(3):036111","journal-title":"Phys Rev E"},{"issue":"4","key":"2571_CR22","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/141000555","volume":"58","author":"E Estrada","year":"2016","unstructured":"Estrada E, Hatano N (2016) Communicability angle and the spatial efficiency of networks. SIAM Rev 58(4):692\u2013715","journal-title":"SIAM Rev"},{"issue":"5","key":"2571_CR23","doi-asserted-by":"crossref","first-page":"056103","DOI":"10.1103\/PhysRevE.71.056103","volume":"71","author":"E Estrada","year":"2005","unstructured":"Estrada E, Rodriguez-Velazquez JA (2005) Subgraph centrality in complex networks. Phys Rev E 71(5):056103","journal-title":"Phys Rev E"},{"issue":"3","key":"2571_CR24","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.physrep.2012.01.006","volume":"514","author":"E Estrada","year":"2012","unstructured":"Estrada E, Hatano N, Benzi M (2012) The physics of communicability in complex networks. Phys Rep 514(3):89\u2013119","journal-title":"Phys Rep"},{"key":"2571_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2013.05.032","volume":"176","author":"E Estrada","year":"2014","unstructured":"Estrada E, Sanchez-Lirola MG, De La Pe\u00f1a JA (2014) Hyperspherical embedding of graphs and networks in communicability spaces. Discrete Appl Math 176:53\u201377","journal-title":"Discrete Appl Math"},{"key":"2571_CR26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.13001\/1081-3810.1012","volume":"3","author":"M Fiedler","year":"1998","unstructured":"Fiedler M (1998) Ultrametric sets in Euclidean point spaces. Electron J Linear Algebra 3:23\u201330","journal-title":"Electron J Linear Algebra"},{"key":"2571_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35\u201341","journal-title":"Sociometry"},{"key":"2571_CR28","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1979","unstructured":"Freeman LC (1979) Centrality in social networks: I. Conceptual clarification. Soc Netw 1:215\u2013239","journal-title":"Soc Netw"},{"issue":"3","key":"2571_CR29","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.3390\/sym2031683","volume":"2","author":"D Garlaschelli","year":"2010","unstructured":"Garlaschelli D, Ruzzenenti F, Basosi R (2010) Complex networks and symmetry I: a review. Symmetry 2(3):1683\u20131709","journal-title":"Symmetry"},{"key":"2571_CR30","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02579330","volume":"1","author":"CD Godsil","year":"1981","unstructured":"Godsil CD (1981) On the full automorphism group of a graph. Combinatorica 1:243\u2013256","journal-title":"Combinatorica"},{"issue":"2","key":"2571_CR31","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0095-8956(82)90030-2","volume":"32","author":"CD Godsil","year":"1982","unstructured":"Godsil CD, Kocay WL (1982) Constructing graphs with pairs of pseudo-similar vertices. J Combin Theory Ser B 32(2):146\u2013155","journal-title":"J Combin Theory Ser B"},{"issue":"4","key":"2571_CR32","first-page":"623","volume":"15","author":"F Harary","year":"1966","unstructured":"Harary F, Palmer ED (1966) On similar points of a graph. J Math Mech 15(4):623\u2013630","journal-title":"J Math Mech"},{"issue":"4","key":"2571_CR33","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1137\/04061101X","volume":"26","author":"NJ Higham","year":"2005","unstructured":"Higham NJ (2005) The scaling and squaring method for the matrix exponential revisited. SIAM J Matrix Anal Appl 26(4):1179\u20131193","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"2571_CR34","doi-asserted-by":"crossref","first-page":"2909","DOI":"10.3934\/mbe.2021147","volume":"18","author":"P Janyasupab","year":"2021","unstructured":"Janyasupab P, Suratanee A, Plaimas K (2021) Network diffusion with centrality measures to identify disease-related genes. Math Biosci Eng 18(3):2909\u20132929","journal-title":"Math Biosci Eng"},{"issue":"1","key":"2571_CR35","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L Katz","year":"1953","unstructured":"Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39\u201343","journal-title":"Psychometrika"},{"key":"2571_CR36","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein DJ, Randi\u0107 M (1993) Resistance distance. J Math Chem 12:81\u201395","journal-title":"J Math Chem"},{"issue":"5","key":"2571_CR37","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"JM Kleinberg","year":"1999","unstructured":"Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM (JACM) 46(5):604\u2013632","journal-title":"J ACM (JACM)"},{"key":"2571_CR38","first-page":"431","volume":"58","author":"W Kocay","year":"2007","unstructured":"Kocay W (2007) Groups & graphs-software for graphs, digraphs, and their automorphism groups. MATCH 58:431\u2013443","journal-title":"MATCH"},{"issue":"2","key":"2571_CR39","first-page":"259","volume":"74","author":"F Koorepazan-Moftakhar","year":"2015","unstructured":"Koorepazan-Moftakhar F, Ashrafi AR (2015) Distance under symmetry. MATCH Commun Math Comput Chem 74(2):259\u2013272","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2571_CR40","first-page":"77","volume":"46","author":"J Lauri","year":"1997","unstructured":"Lauri J (1997) Pseudosimilarity in graphs\u2014a survey. ARS Combin 46:77\u201395","journal-title":"ARS Combin"},{"issue":"4","key":"2571_CR41","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1137\/S0895479895281484","volume":"17","author":"RB Lehoucq","year":"1996","unstructured":"Lehoucq RB, Sorensen DC (1996) Deflation techniques for an implicitly restarted Arnoldi iteration. SIAM J Matrix Anal Appl 17(4):789\u2013821","journal-title":"SIAM J Matrix Anal Appl"},{"key":"2571_CR42","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719628","volume-title":"ARPACK users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods","author":"RB Lehoucq","year":"1998","unstructured":"Lehoucq RB, Sorensen DC, Yang C (1998) ARPACK users\u2019 guide: solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"2","key":"2571_CR43","doi-asserted-by":"crossref","first-page":"026120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht EA, Holme P, Newman ME (2006) Vertex similarity in networks. Phys Rev E 73(2):026120","journal-title":"Phys Rev E"},{"issue":"3","key":"2571_CR44","first-page":"558","volume":"285","author":"AY Lemin","year":"1985","unstructured":"Lemin AY (1985) Isometric imbedding of isosceles (non-Archimedean) spaces into Euclidean ones. Doklady Akademii Nauk 285(3):558\u2013562","journal-title":"Doklady Akademii Nauk"},{"issue":"2","key":"2571_CR45","doi-asserted-by":"crossref","first-page":"026108","DOI":"10.1103\/PhysRevE.86.026108","volume":"86","author":"K Lerman","year":"2012","unstructured":"Lerman K, Ghosh R (2012) Network structure, topology, and dynamics in generalized models of synchronization. Phys Rev E 86(2):026108","journal-title":"Phys Rev E"},{"issue":"1","key":"2571_CR46","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1080\/0022250X.1971.9989788","volume":"1","author":"F Lorrain","year":"1971","unstructured":"Lorrain F, White HC (1971) Structural equivalence of individuals in social networks. J Math Sociol 1(1):49\u201380","journal-title":"J Math Sociol"},{"key":"2571_CR47","doi-asserted-by":"crossref","first-page":"026117","DOI":"10.1103\/PhysRevE.80.026117","volume":"80","author":"BD MacArthur","year":"2009","unstructured":"MacArthur BD, Sanchez-Garcia RJ (2009) Spectral characteristics of network redundancy. Phys Rev E 80:026117","journal-title":"Phys Rev E"},{"issue":"18","key":"2571_CR48","doi-asserted-by":"crossref","first-page":"3525","DOI":"10.1016\/j.dam.2008.04.008","volume":"156","author":"BD MacArthur","year":"2008","unstructured":"MacArthur BD, S\u00e1nchez-Garc\u00eda RJ, Anderson JW (2008) Symmetry in complex networks. Discrete Appl Math 156(18):3525\u20133531","journal-title":"Discrete Appl Math"},{"key":"2571_CR49","volume-title":"Thesaurus of English words and phrases","year":"1911","unstructured":"Mawson S (ed) (1911) Thesaurus of English words and phrases. T. Y. Crowell Co., New York"},{"key":"2571_CR50","doi-asserted-by":"crossref","unstructured":"Meghanathan N (2015) Use of eigenvector centrality to detect graph isomorphism. arXiv preprint arXiv:1511.06620","DOI":"10.5121\/csit.2015.51501"},{"issue":"1","key":"2571_CR51","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/S00361445024180","volume":"45","author":"C Moler","year":"2003","unstructured":"Moler C, Van Loan C (2003) Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Rev 45(1):3\u201349","journal-title":"SIAM Rev"},{"key":"2571_CR52","unstructured":"Murtagh F (2006) Ultrametricity in data: identifying and exploiting local and global hierarchical structure. arXiv:math.ST\/0605555"},{"key":"2571_CR53","doi-asserted-by":"crossref","unstructured":"Rahmani A, Mesbahi M (2007) Pulling the strings on agreement: anchoring, controllability, and graph automorphisms. In: 2007 American control conference. IEEE","DOI":"10.1109\/ACC.2007.4282502"},{"key":"2571_CR54","unstructured":"Reitz JM (2004) Dictionary for library and information science. Libraries Unlimited"},{"key":"2571_CR55","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-319-78512-7_10","volume-title":"A mathematical modeling approach from nonlinear dynamics to complex systems","author":"FA Rodrigues","year":"2019","unstructured":"Rodrigues FA (2019) Network centrality: an introduction. In: Macau EEN (ed) A mathematical modeling approach from nonlinear dynamics to complex systems. Springer, Berlin, pp 177\u2013196"},{"issue":"3","key":"2571_CR56","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF01934203","volume":"10","author":"A Ruhe","year":"1970","unstructured":"Ruhe A (1970) Perturbation bounds for means of eigenvalues and invariant subspaces. BIT Numer Math 10(3):343\u2013354","journal-title":"BIT Numer Math"},{"issue":"1","key":"2571_CR57","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1038\/s42005-020-0345-z","volume":"3","author":"RJ S\u00e1nchez-Garc\u00eda","year":"2020","unstructured":"S\u00e1nchez-Garc\u00eda RJ (2020) Exploiting symmetry in network analysis. Commun Phys 3(1):87","journal-title":"Commun Phys"},{"key":"2571_CR58","unstructured":"Saxena A, Iyengar S (2020) Centrality measures in complex networks: a survey. arXiv preprint arXiv:2011.07190"},{"key":"2571_CR59","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/analys\/anq118","volume":"71","author":"N Shackel","year":"2011","unstructured":"Shackel N (2011) The world as a graph: defending metaphysical graphical structuralism. Analysis 71:10\u201321","journal-title":"Analysis"},{"key":"2571_CR60","unstructured":"Sloane NJ (2018) The on-line encyclopedia of integer sequences. Published electronically at https:\/\/oeis.org"},{"key":"2571_CR61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s10033-020-00524-5","volume":"34","author":"L Sun","year":"2021","unstructured":"Sun L, Ye Z, Lu F, Cui R, Wu C (2021) Similar vertices and isomorphism detection for planar kinematic chains based on ameliorated multi-order adjacent vertex assignment sequence. Chin J Mech Eng 34:1\u201315","journal-title":"Chin J Mech Eng"},{"key":"2571_CR62","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0024-3795(94)00031-X","volume":"232","author":"P Tarazaga","year":"1996","unstructured":"Tarazaga P, Hayden TL, Wells J (1996) Circum-Euclidean distance matrices and faces. Linear Algebra Appl 232:77\u201396","journal-title":"Linear Algebra Appl"},{"key":"2571_CR63","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Methods and applications. Social network analysis","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Methods and applications. Social network analysis. Cambridge University Press, Cambridge"},{"key":"2571_CR64","volume-title":"Handbook of graph theory","author":"ME Watkins","year":"2014","unstructured":"Watkins ME (2014) Automorphisms. In: Gross JL, Yellen J, Zhang P (eds) Handbook of graph theory, 2nd edn. CRC Press, Boca Raton","edition":"2"},{"issue":"4","key":"2571_CR65","doi-asserted-by":"crossref","first-page":"046102","DOI":"10.1103\/PhysRevE.78.046102","volume":"78","author":"Y Xiao","year":"2008","unstructured":"Xiao Y, MacArthur BD, Wang H, Xiong M, Wang W (2008) Network quotients: structural skeletons of complex systems. Phys Rev E 78(4):046102","journal-title":"Phys Rev E"},{"issue":"4","key":"2571_CR66","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1002\/asjc.793","volume":"16","author":"M-G Yoon","year":"2014","unstructured":"Yoon M-G et al (2014) Controllability of multi-agent dynamical systems with a broadcasting control signal. Asian J Control 16(4):1066\u20131072","journal-title":"Asian J Control"},{"key":"2571_CR67","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1134\/S2070046614020046","volume":"6","author":"AP Zubarev","year":"2014","unstructured":"Zubarev AP (2014) On stochastic generation of ultrametrics in high-dimensional Euclidean spaces. p-Adic numbers. Ultrametr Anal Appl 6:155\u2013165","journal-title":"Ultrametr Anal Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02571-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02571-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02571-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T11:05:41Z","timestamp":1707649541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02571-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,10]]},"references-count":67,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["2571"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02571-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,10]]},"assertion":[{"value":"5 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no conflict of interest of any kind.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"49"}}