{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T13:09:15Z","timestamp":1779800955615,"version":"3.53.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T00:00:00Z","timestamp":1779753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T00:00:00Z","timestamp":1779753600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08581-8","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T12:58:23Z","timestamp":1779800303000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mutual visibility in graphs: hierarchical products, genetic algorithm and some applications"],"prefix":"10.1007","volume":"82","author":[{"given":"Zahra","family":"Hamed-Labbafian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mostafa","family":"Tavakoli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Narjes","family":"Sabeghi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aleksander","family":"Vesel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,26]]},"reference":[{"key":"8581_CR1","doi-asserted-by":"publisher","first-page":"353","DOI":"10.26493\/1855-3974.834.b02","volume":"11","author":"V Andova","year":"2016","unstructured":"Andova V, Kardo\u0161 F, \u0160krekovski R (2016) Mathematical aspects of fullerenes. Ars Mathematica Contemporanea 11:353\u2013379","journal-title":"Ars Mathematica Contemporanea"},{"issue":"1","key":"8581_CR2","first-page":"32","volume":"8","author":"A Aljohani","year":"2018","unstructured":"Aljohani A, Sharma G (2018) Complete visibility for mobile robots with lights tolerating faults. Int J Netw Comput 8(1):32\u201352","journal-title":"Int J Netw Comput"},{"key":"8581_CR3","doi-asserted-by":"crossref","unstructured":"Axenovich M, Liu D (2025) Visibility in Hypercubes.arXiv:2402.04791","DOI":"10.1007\/s00373-026-03025-9"},{"key":"8581_CR4","first-page":"31","volume-title":"International Workshop on Algorithms and Computation","author":"S Bhagat","year":"2020","unstructured":"Bhagat S (2020) Optimum algorithm for the mutual visibility problem. International Workshop on Algorithms and Computation. Springer International Publishing, Cham, pp 31\u201342"},{"key":"8581_CR5","doi-asserted-by":"crossref","unstructured":"Bil\u00f3 D, Di Fonso A, Di Stefano G, Leucci S (2026) On the approximability of graph visibility problems. Theoret Comput Sci 115766","DOI":"10.1016\/j.tcs.2026.115766"},{"key":"8581_CR6","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.procs.2023.08.219","volume":"223","author":"S Cicerone","year":"2023","unstructured":"Cicerone S, Di Stefano G (2023) Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. Procedia Comput Sci 223:104\u2013111","journal-title":"Procedia Comput Sci"},{"key":"8581_CR7","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.dam.2024.06.038","volume":"358","author":"S Cicerone","year":"2024","unstructured":"Cicerone S, Di Stefano G, Klav\u017ear S, Yero IG (2024) Mutual-visibility in strong products of graphs via total mutual-visibility. Discrete Appl Math 358:136\u2013146","journal-title":"Discrete Appl Math"},{"key":"8581_CR8","volume":"491","author":"S Cicerone","year":"2025","unstructured":"Cicerone S, Di Fonso A, Di Stefano G, Navarra A, Piselli F (2025) Mutual and total mutual visibility in hypercube-like graphs. Appl Math Comput 491:129216","journal-title":"Appl Math Comput"},{"key":"8581_CR9","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GA Di Luna","year":"2017","unstructured":"Di Luna GA, Flocchini P, Chaudhuri SG, Poloni F, Santoro N, Viglietta G (2017) Mutual visibility by luminous robots without collisions. Inf Comput 254:392\u2013418","journal-title":"Inf Comput"},{"key":"8581_CR10","volume":"419","author":"G Di Stefano","year":"2022","unstructured":"Di Stefano G (2022) Mutual visibility in graphs. Appl Math Comput 419:126850","journal-title":"Appl Math Comput"},{"key":"8581_CR11","unstructured":"Dobrynin AA, Gutman I (1994) On a graph invariant related to the sum of all distances in a graph.(Publications De)"},{"key":"8581_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"RH Hammack","year":"2011","unstructured":"Hammack RH, Imrich W, Klav\u017ear S, Imrich W, Klav\u017ear S (2011) Handbook of Product Graphs, vol 2. CRC Press, Boca Raton"},{"key":"8581_CR13","doi-asserted-by":"crossref","unstructured":"Kor\u017ee D, Vesel A (2024) Mutual-visibility sets in Cartesian products of paths and cycles. RM 79(3):116","DOI":"10.1007\/s00025-024-02139-x"},{"key":"8581_CR14","volume":"491","author":"D Kor\u017ee","year":"2025","unstructured":"Kor\u017ee D, Vesel A (2025) Variety of mutual-visibility problems in hypercubes. Appl Math Comput 491:129218","journal-title":"Appl Math Comput"},{"issue":"6","key":"8581_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s40840-023-01590-3","volume":"46","author":"D Kuziak","year":"2023","unstructured":"Kuziak D, Rodr\u00edguez-Vel\u00e1zquez JA (2023) Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products. Bull Malays Math Sci Soc 46(6):197","journal-title":"Bull Malays Math Sci Soc"},{"key":"8581_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.spjpm.2017.02.002","author":"AI Melker","year":"2017","unstructured":"Melker AI, Krupina MA (2017) Geometric modeling of midi-fullerene growth from $$C_{32}$$ to $$C_{60}$$. Petersburg Polytechnical University Journal Physics and Mathe-matics St. https:\/\/doi.org\/10.1016\/j.spjpm.2017.02.002","journal-title":"Petersburg Polytechnical University Journal Physics and Mathe-matics St"},{"key":"8581_CR17","doi-asserted-by":"crossref","unstructured":"Ohanu CP, Rufai SA, Oluchi UC (2024) A comprehensive review of recent developments in smart grid through renewable energy resources integration. Heliyon 10(3):","DOI":"10.1016\/j.heliyon.2024.e25705"},{"key":"8581_CR18","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2020.10.033","volume":"850","author":"P Poudel","year":"2021","unstructured":"Poudel P, Aljohani A, Sharma G (2021) Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. Theoret Comput Sci 850:116\u2013134","journal-title":"Theoret Comput Sci"},{"key":"8581_CR19","doi-asserted-by":"crossref","unstructured":"Wang H, Xu H, Wang X, Wang W, Chen S, Zheng D (2020) Research on energy management of integrated energy systems considering multi-agent. In: 2020 IEEE Sustainable Power and Energy Conference (iSPEC) (pp. 1397\u20131403). IEEE","DOI":"10.1109\/iSPEC50848.2020.9351078"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08581-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08581-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08581-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T12:58:26Z","timestamp":1779800306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08581-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,26]]},"references-count":19,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["8581"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08581-8","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,26]]},"assertion":[{"value":"3 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"455"}}