{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:30:42Z","timestamp":1769157042951,"version":"3.49.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T00:00:00Z","timestamp":1742169600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T00:00:00Z","timestamp":1742169600000},"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":["Comp. Appl. Math."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s40314-025-03154-6","type":"journal-article","created":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T04:21:46Z","timestamp":1742185306000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["RDDGN: minimizing the total resistance distance and diameter using graph neural networks"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7146-5639","authenticated-orcid":false,"given":"Muhammad Shoaib","family":"Sardar","sequence":"first","affiliation":[]},{"given":"Muhammad Shahid","family":"Iqbal","sequence":"additional","affiliation":[]},{"given":"Shou-Jun","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,17]]},"reference":[{"key":"3154_CR1","doi-asserted-by":"crossref","unstructured":"Adriaens F, Gionis A (2022) Diameter minimization by shortcutting with degree constraints. In: 2022 IEEE international conference on data mining (ICDM). IEEE, pp 843\u2013848","DOI":"10.1109\/ICDM54844.2022.00095"},{"key":"3154_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.dam.2024.09.026","volume":"361","author":"Y Ahmad","year":"2025","unstructured":"Ahmad Y, Pan XF, Ali U, Diao Z (2025) Computing the expected value of invariants based on resistance distance for random spiro-polynomio chains. Discrete Appl Math 361:111\u2013120","journal-title":"Discrete Appl Math"},{"key":"3154_CR3","doi-asserted-by":"crossref","unstructured":"Alstrup S, Holm J, de Lichtenberg K, Thorup M (1997) Minimizing diameters of dynamic trees. In: Proceedings of the automata, languages and programming: 24th international colloquium, ICALP\u201997 Bologna, Italy, July 7\u201311, 1997, vol 24. Springer, Berlin, pp 270\u2013280","DOI":"10.1007\/3-540-63165-8_184"},{"key":"3154_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.dam.2018.10.043","volume":"258","author":"W Barrett","year":"2019","unstructured":"Barrett W, Evans EJ, Francis AE (2019) Resistance distance in straight linear 2-trees. Discrete Appl Math 258:13\u201334","journal-title":"Discrete Appl Math"},{"issue":"1","key":"3154_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/2.976921","volume":"35","author":"L Benini","year":"2002","unstructured":"Benini L, De Micheli G (2002) Networks on chips: a new SoC paradigm. Computer 35(1):70\u201378","journal-title":"Computer"},{"key":"3154_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comgeo.2019.01.003","volume":"80","author":"P Carmi","year":"2019","unstructured":"Carmi P, Chaitman-Yerushalmi L, Ozeri BC (2019) Minimizing the sum of distances to a server in a constraint network. Comput Geom 80:1\u201312","journal-title":"Comput Geom"},{"key":"3154_CR7","doi-asserted-by":"crossref","unstructured":"Demaine ED, Zadimoghaddam M (2010) Minimizing the diameter of a network using shortcut edges. In: Scandinavian workshop on algorithm theory. Springer, Berlin, pp 420\u2013431","DOI":"10.1007\/978-3-642-13731-0_39"},{"key":"3154_CR8","doi-asserted-by":"crossref","unstructured":"Doddi SR, Marathe MV, Ravi SS, Taylor DS, Widmayer P (2000) Approximation algorithms for clustering to minimize the sum of diameters. In: Scandinavian workshop on algorithm theory. Springer, Berlin, pp 237\u2013250","DOI":"10.1007\/3-540-44985-X_22"},{"key":"3154_CR9","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.dam.2020.02.002","volume":"283","author":"J Ge","year":"2020","unstructured":"Ge J, Dong F (2020) Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. Discrete Appl Math 283:542\u2013554","journal-title":"Discrete Appl Math"},{"issue":"1","key":"3154_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/050645452","volume":"50","author":"A Ghosh","year":"2008","unstructured":"Ghosh A, Boyd S, Saberi A (2008) Minimizing effective resistance of a graph. SIAM Rev 50(1):37\u201366","journal-title":"SIAM Rev"},{"key":"3154_CR11","doi-asserted-by":"crossref","unstructured":"Hackett A, Ajwani D, Ali S, Kirkland S, Morrison JP (2013) A network configuration algorithm based on optimization of Kirchhoff index. In: 2013 IEEE 27th international symposium on parallel and distributed processing. IEEE, pp 407\u2013417","DOI":"10.1109\/IPDPS.2013.116"},{"issue":"03","key":"3154_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1142\/S0129626499000335","volume":"9","author":"SE Hambrusch","year":"1999","unstructured":"Hambrusch SE, Lim HS (1999) Minimizing the diameter in tree networks under edge reductions. Parallel Process Lett 9(03):361\u2013371","journal-title":"Parallel Process Lett"},{"key":"3154_CR13","first-page":"348","volume":"341","author":"G Huang","year":"2019","unstructured":"Huang G, He W, Tan Y (2019) Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness. Appl Math Comput 341:348\u2013357","journal-title":"Appl Math Comput"},{"issue":"1","key":"3154_CR14","first-page":"61","volume":"5","author":"TN Kipf","year":"2016","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. IEEE Trans Neural Netw 5(1):61\u201380","journal-title":"IEEE Trans Neural Netw"},{"issue":"1","key":"3154_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01164627","volume":"12","author":"DJ Klein","year":"1993","unstructured":"Klein DJ, Randic M (1993) Resistance distance. J Math Chem 12(1):81\u201395","journal-title":"J Math Chem"},{"key":"3154_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In: Proceedings of the thirty-second annual ACM symposium on theory of computing, pp 163\u2013170","DOI":"10.1145\/335305.335325"},{"key":"3154_CR17","doi-asserted-by":"crossref","unstructured":"Kleinberg J (2001) Small-world phenomena and the dynamics of information. Adv Neural Inf Process Syst 14","DOI":"10.7551\/mitpress\/1120.003.0060"},{"key":"3154_CR18","volume":"382","author":"Z Li","year":"2020","unstructured":"Li Z, Xie Z, Li J, Pan Y (2020) Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star. Appl Math Comput 382:125335","journal-title":"Appl Math Comput"},{"key":"3154_CR19","doi-asserted-by":"publisher","first-page":"36617","DOI":"10.1109\/ACCESS.2019.2902012","volume":"7","author":"Q Liu","year":"2019","unstructured":"Liu Q (2019) The resistance distance and Kirchhoff index on quadrilateral graph and pentagonal graph. IEEE Access 7:36617\u201336622","journal-title":"IEEE Access"},{"key":"3154_CR20","first-page":"84","volume":"291","author":"JB Liu","year":"2016","unstructured":"Liu JB, Pan XF (2016) Minimizing Kirchhoff index among graphs with a given vertex bipartiteness. Appl Math Comput 291:84\u201388","journal-title":"Appl Math Comput"},{"key":"3154_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2015.07.001","volume":"200","author":"JB Liu","year":"2016","unstructured":"Liu JB, Pan XF, Yu L, Li D (2016) Complete characterization of bicyclic graphs with minimal Kirchhoff index. Discrete Appl Math 200:95\u2013107","journal-title":"Discrete Appl Math"},{"key":"3154_CR22","doi-asserted-by":"publisher","first-page":"55673","DOI":"10.1109\/ACCESS.2018.2871840","volume":"6","author":"Q Liu","year":"2018","unstructured":"Liu Q, Liu JB, Wang S (2018) Resistance distance and Kirchhoff index of the corona-vertex and the corona-edge of subdivision graph. IEEE Access 6:55673\u201355679","journal-title":"IEEE Access"},{"issue":"3","key":"3154_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/(SICI)1097-461X(1999)71:3<217::AID-QUA1>3.0.CO;2-C","volume":"71","author":"I Lukovits","year":"1999","unstructured":"Lukovits I, Nikolic S, Trinajstic N (1999) Resistance distance in regular graphs. Int J Quantum Chem 71(3):217\u2013225","journal-title":"Int J Quantum Chem"},{"issue":"1","key":"3154_CR24","first-page":"1","volume":"5","author":"I Milovanovic","year":"2020","unstructured":"Milovanovic I, Glogic E, Matejic M, Milovanovic E (2020) On relation between the Kirchhoff index and number of spanning trees of graph. Commun Combin Optim 5(1):1\u20138","journal-title":"Commun Combin Optim"},{"issue":"1","key":"3154_CR25","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/1097-461X(2001)81:1<29::AID-QUA6>3.0.CO;2-Y","volume":"81","author":"JL Palacios","year":"2001","unstructured":"Palacios JL (2001) Resistance distance in graphs and random walks. Int J Quantum Chem 81(1):29\u201333","journal-title":"Int J Quantum Chem"},{"issue":"4","key":"3154_CR26","doi-asserted-by":"publisher","first-page":"902","DOI":"10.1007\/s10910-023-01573-6","volume":"62","author":"W Sajjad","year":"2024","unstructured":"Sajjad W, Pan XF, Tul Ain Q (2024) Computation of resistance distance with Kirchhoff index of body centered cubic structure. J Math Chem 62(4):902\u2013921","journal-title":"J Math Chem"},{"key":"3154_CR27","volume":"461","author":"W Sajjad","year":"2024","unstructured":"Sajjad W, Sardar MS, Pan XF (2024) Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron. Appl Math Comput 461:128313","journal-title":"Appl Math Comput"},{"issue":"4","key":"3154_CR28","doi-asserted-by":"publisher","first-page":"919","DOI":"10.22199\/issn.0717-6279-2020-04-0057","volume":"39","author":"MS Sardar","year":"2020","unstructured":"Sardar MS, Cancan M, Ediz S, Sajjad W (2020) Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of $$P_2$$ and $$K_n$$. Proyecciones (Antofagasta) 39(4):919\u2013932","journal-title":"Proyecciones (Antofagasta)"},{"key":"3154_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.123076","volume":"540","author":"MS Sardar","year":"2020","unstructured":"Sardar MS, Hua H, Pan XF, Raza H (2020) On the resistance diameter of hypercubes. Physica A 540:123076","journal-title":"Physica A"},{"key":"3154_CR30","volume":"381","author":"MS Sardar","year":"2020","unstructured":"Sardar MS, Pan XF, Xu SA (2020) Computation of resistance distance and Kirchhoff index of the two classes of silicate networks. Appl Math Comput 381:125283","journal-title":"Appl Math Comput"},{"key":"3154_CR31","volume":"473","author":"MS Sardar","year":"2024","unstructured":"Sardar MS, Pan XF, Xu SJ (2024) Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs. Appl Math Comput 473:128670","journal-title":"Appl Math Comput"},{"key":"3154_CR32","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2022.896886","volume":"10","author":"W Sun","year":"2022","unstructured":"Sun W, Yang Y (2022) A note on resistance distances of graphs. Front Phys 10:896886","journal-title":"Front Phys"},{"key":"3154_CR33","volume":"437","author":"W Sun","year":"2023","unstructured":"Sun W, Yang Y (2023) Extremal pentagonal chains with respect to the Kirchhoff index. Appl Math Comput 437:127534","journal-title":"Appl Math Comput"},{"key":"3154_CR34","volume-title":"Topological structure and analysis of interconnection networks","author":"J Xu","year":"2013","unstructured":"Xu J (2013) Topological structure and analysis of interconnection networks, vol 7. Springer"},{"key":"3154_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.04.018","volume":"526","author":"T Zhang","year":"2019","unstructured":"Zhang T, Bu C (2019) Detecting community structure in complex networks via resistance distance. Physica A 526:120782","journal-title":"Physica A"},{"issue":"1","key":"3154_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12190-019-01306-6","volume":"63","author":"J Zhao","year":"2020","unstructured":"Zhao J, Liu JB, Hayat S (2020) Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs. J Appl Math Comput 63(1):1\u201327","journal-title":"J Appl Math Comput"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03154-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03154-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03154-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T04:26:54Z","timestamp":1744604814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03154-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,17]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["3154"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03154-6","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,17]]},"assertion":[{"value":"31 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2025","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 authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"192"}}