{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:44:40Z","timestamp":1760197480424,"version":"build-2065373602"},"reference-count":82,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T00:00:00Z","timestamp":1531353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministerio de Economia y Competititvidad","award":["MTM2012-30719, MTM2013-46374-P, MTM2016-78227-C2-1-P and MTM2015-69323-REDT"],"award-info":[{"award-number":["MTM2012-30719, MTM2013-46374-P, MTM2016-78227-C2-1-P and MTM2015-69323-REDT"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>It is well-known that the different products of graphs are some of the more symmetric classes of graphs. Since we are interested in hyperbolicity, it is interesting to study this property in products of graphs. Some previous works characterize the hyperbolicity of several types of product graphs (Cartesian, strong, join, corona and lexicographic products). However, the problem with the direct product is more complicated. The symmetry of this product allows us to prove that, if the direct product G1\u00d7G2 is hyperbolic, then one factor is bounded and the other one is hyperbolic. Besides, we prove that this necessary condition is also sufficient in many cases. In other cases, we find (not so simple) characterizations of hyperbolic direct products. Furthermore, we obtain good bounds, and even formulas in many cases, for the hyperbolicity constant of the direct product of some important graphs (as products of path, cycle and even general bipartite graphs).<\/jats:p>","DOI":"10.3390\/sym10070279","type":"journal-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T11:19:24Z","timestamp":1531394364000},"page":"279","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hyperbolicity of Direct Products of Graphs"],"prefix":"10.3390","volume":"10","author":[{"given":"Walter","family":"Carballosa","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Florida International University, 11200 SW 8th Street, Miami, FL 33199, USA"},{"name":"Department of Mathematics, Miami Dade College, 300 NE Second Ave. Miami, FL 33132, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amauris","family":"De la Cruz","sequence":"additional","affiliation":[{"name":"Departamento de Matem\u00e1ticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, Legan\u00e9s, 28911 Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1344-6189","authenticated-orcid":false,"given":"Alvaro","family":"Mart\u00ednez-P\u00e9rez","sequence":"additional","affiliation":[{"name":"Facultad CC. Sociales de Talavera, Universidad de Castilla La Mancha, Avda. Real F\u00e1brica de Seda, s.n. Talavera de la Reina, 45600 Toledo, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2851-7442","authenticated-orcid":false,"given":"Jos\u00e9 M.","family":"Rodr\u00edguez","sequence":"additional","affiliation":[{"name":"Departamento de Matem\u00e1ticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, Legan\u00e9s, 28911 Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,7,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., and Klav\u017ear, S. (2011). Handbook of Product Graphs, CRC Press. [2rd ed.].","DOI":"10.1201\/b10959"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","article-title":"The Kronecker product of graphs","volume":"13","author":"Weichsel","year":"1962","journal-title":"Proc. Am. Math. Soc."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"491","DOI":"10.7151\/dmgt.1247","article-title":"Centers of n-fold tensor products of graphs","volume":"24","author":"Bendall","year":"2004","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1137\/S0895480103438358","article-title":"Hypercubes as direct products","volume":"18","author":"Imrich","year":"2005","journal-title":"SIAM J. Discret. Math."},{"key":"ref_5","first-page":"213","article-title":"Minimum cycle bases of direct products of bipartite graphs","volume":"36","author":"Hammack","year":"2006","journal-title":"Australas. J. Combin."},{"key":"ref_6","first-page":"83","article-title":"Finite and infinite hypercubes as direct products","volume":"36","author":"Imrich","year":"2006","journal-title":"Australas. J. Combin."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.7151\/dmgt.1307","article-title":"A prime factor theorem for a generalized direct product","volume":"26","author":"Imrich","year":"2006","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_8","first-page":"53","article-title":"Independence in direct-product graphs","volume":"50","author":"Jha","year":"1998","journal-title":"Ars Combin."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(97)00215-X","article-title":"Hamilton cycles in tensor product of graphs","volume":"186","author":"Balakrishnan","year":"1998","journal-title":"Discret. Math."},{"key":"ref_10","first-page":"3","article-title":"Hamiltonian cycle decomposition of Kronecker product of some cubic graphs by cycles","volume":"32","author":"Kheddouci","year":"2000","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"ref_11","unstructured":"Imrich, W., and Klav\u017ear, S. (2000). Product Graphs: Structure and Recognition, John Wiley & Sons."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.11650\/twjm\/1500406890","article-title":"A survey on Hedetniemi\u2019s conjecture","volume":"2","author":"Zhu","year":"1998","journal-title":"Taiwanese J. Math."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0012-365X(98)00069-7","article-title":"Factoring cardinal product graphs in polynomial time","volume":"192","author":"Imrich","year":"1998","journal-title":"Discr. Math."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Ghys, E., Haefliger, A., and Verjovsky, A. (1992). Notes on word hyperbolic groups. Group Theory from a Geometrical Viewpoint, World Scientific.","DOI":"10.1142\/9789814539746"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Ghys, E., and de la Harpe, P. (1990). Sur les Groupes Hyperboliques d\u2019apr\u00e8s Mikhael Gromov, Birkh\u00e4user Boston Inc.. Progress in Mathematics 83.","DOI":"10.1007\/978-1-4684-9167-8"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4613-9586-7_3","article-title":"Hyperbolic groups","volume":"Volume 8","author":"Gersten","year":"1987","journal-title":"Essays in Group Theory"},{"key":"ref_17","unstructured":"Oshika, K. (2002). Discrete Groups, AMS Bookstore."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/BF01444642","article-title":"Artin groups of finite type are biautomatic","volume":"292","author":"Charney","year":"1992","journal-title":"Math. Ann."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chepoi, V., and Estellon, B. (2007). Packing and covering \u03b4-hyperbolic spaces by balls. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Springer.","DOI":"10.1007\/978-3-540-74208-1_5"},{"key":"ref_20","unstructured":"Eppstein, D. (2017, January 16\u201319). Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA\u20192007), Barcelona, Spain."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Gavoille, C., and Ly, O. (2005). Distance labeling in hyperbolic graphs. Proceedings of the International Symposium on Algorithms and Computation (ISAAC), Springer.","DOI":"10.1007\/11602613_106"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Krauthgamer, R., and Lee, J.R. (2006, January 21\u201324). Algorithms on negatively curved spaces. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), Berkeley, CA, USA.","DOI":"10.1109\/FOCS.2006.9"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TNET.2007.899021","article-title":"On Internet embedding in hyperbolic spaces for overlay construction and distance estimation","volume":"16","author":"Shavitt","year":"2008","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Verbeek, K., and Suri, S. (2014, January 8\u201311). Metric embeddings, hyperbolic space and social networks. Proceedings of the 30th Annual Symposium on Computational Geometry, Kyoto, Japan.","DOI":"10.1145\/2582112.2582139"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"P43","DOI":"10.37236\/530","article-title":"Chordality and hyperbolicity of a graph","volume":"18","author":"Wu","year":"2011","journal-title":"Electr. J. Comb."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1002\/net.21631","article-title":"Metric tree-like structures in real-life networks: An empirical study","volume":"67","author":"Dragan","year":"2016","journal-title":"Networks"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Adcock, A.B., Sullivan, B.D., and Mahoney, M.W. (2013, January 7\u201310). Tree-like structure in large social and information networks. Proceedings of the 13th Int Conference Data Mining (ICDM), Dallas, TX, USA.","DOI":"10.1109\/ICDM.2013.77"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","article-title":"Hyperbolic geometry of complex networks","volume":"82","author":"Krioukov","year":"2010","journal-title":"Phys. Rev. E"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Montgolfier, F., Soto, M., and Viennot, L. (2011, January 25\u201327). Treewidth and Hyperbolicity of the Internet. Proceedings of the 10th IEEE International Symposium on Network Computing and Applications (NCA), Cambridge, MA, USA.","DOI":"10.1109\/NCA.2011.11"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Chepoi, V., Dragan, F.F., and Vax\u00e8s, Y. (2017, January 16\u201319). Core congestion is inherent in hyperbolic networks. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain.","DOI":"10.1137\/1.9781611974782.149"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Grippo, E., and Jonckheere, E.A. (2016, January 19\u201322). Effective resistance criterion for negative curvature: application to congestion control. Proceedings of the 2016 IEEE Conference on Control Applications (CCA), Buenos Aires, Argentina.","DOI":"10.1109\/CCA.2016.7587833"},{"key":"ref_32","first-page":"45","article-title":"Contr\u00f4le du traffic sur les r\u00e9seaux \u00e0 g\u00e9om\u00e9trie hyperbolique\u2014Vers une th\u00e9orie g\u00e9om\u00e9trique de la s\u00e9curit\u00e9 l\u2019acheminement de l\u2019information","volume":"8","author":"Jonckheere","year":"2002","journal-title":"J. Eur. Syst. Autom."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Jonckheere, E.A., and Lohsoonthorn, P. (July, January 30). Geometry of network security. Proceedings of the 2004 American Control Conference, Boston, MA, USA.","DOI":"10.23919\/ACC.2004.1386698"},{"key":"ref_34","first-page":"134","article-title":"Traffic Congestion in Expanders, (p,\u03b4)-Hyperbolic Spaces and Product of Trees","volume":"11","author":"Li","year":"2015","journal-title":"Int. Math."},{"key":"ref_35","first-page":"27","article-title":"Lack of Gromov-hyperbolicity in colored random networks","volume":"21","author":"Shang","year":"2011","journal-title":"Pan-Am. Math. J."},{"key":"ref_36","first-page":"1152","article-title":"Lack of Gromov-hyperbolicity in small-world networks","volume":"10","author":"Shang","year":"2012","journal-title":"Cent. Eur. J. Math."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/15326349.2013.838510","article-title":"Non-hyperbolicity of random graphs with given expected degrees","volume":"29","author":"Shang","year":"2013","journal-title":"Stoch. Models"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.plrev.2017.11.003","article-title":"Network science of biological systems at different scales: A review","volume":"24","author":"Gosak","year":"2018","journal-title":"Phys. Life Rev."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/j.jmaa.2011.02.067","article-title":"Graphs and Gromov hyperbolicity of non-constant negatively curved surfaces","volume":"380","year":"2011","journal-title":"J. Math. Anal. Appl."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"4592","DOI":"10.1016\/j.camwa.2011.10.041","article-title":"Computing the hyperbolicity constant","volume":"62","author":"Bermudo","year":"2011","journal-title":"Comput. Math. Appl."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1016\/j.disc.2013.04.009","article-title":"Gromov hyperbolic graphs","volume":"313","author":"Bermudo","year":"2013","journal-title":"Discr. Math."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00026-001-8007-7","article-title":"On the hyperbolicity of chordal graphs","volume":"5","author":"Brinkmann","year":"2001","journal-title":"Ann. Comb."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.endm.2008.06.046","article-title":"Notes on diameters, centers, and approximating trees of \u03b4-hyperbolic geodesic spaces and graphs","volume":"31","author":"Chepoi","year":"2008","journal-title":"Electr. Notes Discr. Math."},{"key":"ref_44","unstructured":"Dragan, F., and Mohammed, A. (arXiv, 2017). Slimness of graphs, arXiv."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"P3.51","DOI":"10.37236\/5315","article-title":"Chordality properties and hyperbolicity on graphs","volume":"23","year":"2016","journal-title":"Electr. J. Comb."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12044-010-0048-6","article-title":"Gromov hyperbolicity in Cartesian product graphs","volume":"120","author":"Michel","year":"2010","journal-title":"Proc. Indian Acad. Sci. Math. Sci."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.disc.2010.11.005","article-title":"On the hyperbolicity constant in graphs","volume":"311","author":"Sigarreta","year":"2011","journal-title":"Discr. Math."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0012-365X(01)00115-7","article-title":"Graph homotopy and Graham homotopy","volume":"241","author":"Chen","year":"2001","journal-title":"Discret. Math."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.physa.2016.03.021","article-title":"On the likelihood of forests","volume":"456","author":"Shang","year":"2016","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1016\/j.ipl.2015.02.002","article-title":"Computing the Gromov hyperbolicity of a discrete metric space","volume":"115","author":"Fournier","year":"2015","journal-title":"Inf. Process. Lett."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1090\/dimacs\/025\/10","article-title":"An algorithm detecting hyperbolicity","volume":"Volume 25","author":"Papasoglu","year":"1996","journal-title":"Geometric and Computational Perspectives on Infinite Groups, DIMACS"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"1987","DOI":"10.1137\/130941328","article-title":"Cop and robber game and hyperbolicity","volume":"28","author":"Chalopin","year":"2015","journal-title":"SIAM J. Discr. Math."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s12044-013-0149-0","article-title":"Hyperbolicity in median graphs","volume":"123","author":"Sigarreta","year":"2013","journal-title":"Proc. Indian Acad. Sci. Math. Sci."},{"key":"ref_54","first-page":"367","article-title":"New inequalities on the hyperbolicity constant of line graphs","volume":"129","author":"Carballosa","year":"2016","journal-title":"Ars Combin."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"P210","DOI":"10.37236\/697","article-title":"Gromov hyperbolicity of line graphs","volume":"18","author":"Carballosa","year":"2011","journal-title":"Electr. J. Comb."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Cohen, N., Coudert, D., Ducoffe, G., and Lancin, A. (2017). Applying clique-decomposition for computing Gromov hyperbolicity. Theor. Comp. Sci.","DOI":"10.1016\/j.tcs.2017.06.001"},{"key":"ref_57","first-page":"1141","article-title":"Gromov hyperbolic cubic graphs","volume":"10","author":"Pestana","year":"2012","journal-title":"Central Eur. J. Math."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1016\/j.aml.2011.05.011","article-title":"Hyperbolicity and complement of graphs","volume":"24","author":"Bermudo","year":"2011","journal-title":"Appl. Math. Lett."},{"key":"ref_59","first-page":"395","article-title":"Gromov hyperbolicity of regular graphs","volume":"130","author":"Sigarreta","year":"2017","journal-title":"Ars Combin."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"2599","DOI":"10.2298\/FIL1609599B","article-title":"On the hyperbolicity of edge-chordal and path-chordal graphs","volume":"30","author":"Bermudo","year":"2016","journal-title":"Filomat"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1007\/s00373-014-1459-4","article-title":"Planarity and hyperbolicity in graphs","volume":"31","author":"Carballosa","year":"2015","journal-title":"Graphs Combin."},{"key":"ref_62","first-page":"193","article-title":"Gromov hyperbolic tessellation graphs","volume":"97","author":"Portilla","year":"2015","journal-title":"Utilitas Math."},{"key":"ref_63","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.dam.2016.06.017","article-title":"On the hyperbolicity of bipartite graphs and intersection graphs","volume":"214","author":"Coudert","year":"2016","journal-title":"Discr. Appl. Math."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.2969\/jmsj\/06731213","article-title":"Counting subgraphs in hyperbolic graphs with symmetry","volume":"67","author":"Calegari","year":"2015","journal-title":"J. Math. Soc. Jpn."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"S89","DOI":"10.1007\/s40840-015-0250-x","article-title":"Gromov hyperbolicity of periodic graphs","volume":"39","author":"Granados","year":"2016","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10114-013-2370-2","article-title":"Gromov hyperbolicity of periodic planar graphs","volume":"30","author":"Granados","year":"2014","journal-title":"Acta Math. Sin."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1006\/eujc.2002.0591","article-title":"Hyperbolic Bridged Graphs","volume":"23","author":"Koolen","year":"2002","journal-title":"Eur. J. Comb."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10114-013-2467-7","article-title":"Characterization of Gromov hyperbolic short graphs","volume":"30","year":"2014","journal-title":"Acta Math. Sin."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s41980-018-0032-y","article-title":"Gromov hyperbolicity of graph minors","volume":"44","author":"Carballosa","year":"2018","journal-title":"Bull. Iran. Math. Soc."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"3073","DOI":"10.1016\/j.disc.2016.06.013","article-title":"Small values of the hyperbolicity constant in graphs","volume":"339","author":"Bermudo","year":"2016","journal-title":"Discr. Math."},{"key":"ref_71","doi-asserted-by":"crossref","unstructured":"Granados, A., Pestana, D., Portilla, A., and Rodr\u00edguez, J.M. (2017). Gromov hyperbolicity in Mycielskian Graphs. Symmetry, 9.","DOI":"10.3390\/sym9080131"},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Hern\u00e1ndez, J.C., Reyes, R., Rodr\u00edguez, J.M., and Sigarreta, J.M. (2017). Mathematical properties on the hyperbolicity of interval graphs. Symmetry, 9.","DOI":"10.3390\/sym9110255"},{"key":"ref_73","doi-asserted-by":"crossref","unstructured":"Carballosa, W., de la Cruz, A., and Rodr\u00edguez, J.M. (2017). Gromov hyperbolicity in the Cartesian sum of graphs. Bull. Iran. Math. Soc., 1\u201320.","DOI":"10.1007\/s12044-018-0451-y"},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"2","DOI":"10.37236\/3271","article-title":"Gromov hyperbolicity in strong product graphs","volume":"20","author":"Carballosa","year":"2013","journal-title":"Electr. J. Comb."},{"key":"ref_75","unstructured":"Carballosa, W., de la Cruz, A., and Rodr\u00edguez, J.M. (arXiv, 2015). Gromov hyperbolicity in lexicographic product graphs, arXiv."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1007\/s00010-014-0324-0","article-title":"Hyperbolicity in the corona and join of graphs","volume":"89","author":"Carballosa","year":"2015","journal-title":"Aequ. Math."},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Ghys, E., Haefliger, A., and Verjovsky, A. (1991). Notes on Gromov\u2019s hyperbolicity criterion for path-metric spaces. Group Theory from a Geometrical Viewpoint, World Scientific.","DOI":"10.1142\/9789814539746"},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1016\/j.jfa.2012.11.014","article-title":"A quantitative version of the Morse lemma and quasi-isometries fixing the ideal boundary","volume":"264","author":"Shchur","year":"2013","journal-title":"J. Funct. Anal."},{"key":"ref_79","first-page":"53","article-title":"Gromov hyperbolicity through decomposition of metric spaces","volume":"103","year":"2004","journal-title":"Acta Math. Hung."},{"key":"ref_80","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10711-006-9102-z","article-title":"Gromov hyperbolicity of Denjoy domains","volume":"121","author":"Alvarez","year":"2006","journal-title":"Geom. Dedic."},{"key":"ref_81","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF00181569","article-title":"Quasi-geodesics segments and Gromov hyperbolic spaces","volume":"62","author":"Bonk","year":"1996","journal-title":"Geom. Dedicata"},{"key":"ref_82","first-page":"53","article-title":"Random Lifts Of Graphs: Network Robustness Based On The Estrada Index","volume":"12","author":"Shang","year":"2012","journal-title":"Appl. Math. E-Notes"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/7\/279\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:11:53Z","timestamp":1760195513000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/7\/279"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,12]]},"references-count":82,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2018,7]]}},"alternative-id":["sym10070279"],"URL":"https:\/\/doi.org\/10.3390\/sym10070279","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2018,7,12]]}}}