{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:05:42Z","timestamp":1777539942291,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T00:00:00Z","timestamp":1527638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NNSF of China","doi-asserted-by":"crossref","award":["11671202"],"award-info":[{"award-number":["11671202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2013M530253"],"award-info":[{"award-number":["2013M530253"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2014T70512"],"award-info":[{"award-number":["2014T70512"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Korean National Research Foundation Singapore","award":["2017R1D1A1B03028642"],"award-info":[{"award-number":["2017R1D1A1B03028642"]}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"crossref","award":["P1-0297"],"award-info":[{"award-number":["P1-0297"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-018-0311-9","type":"journal-article","created":{"date-parts":[[2018,5,30]],"date-time":"2018-05-30T07:08:25Z","timestamp":1527664105000},"page":"1388-1410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Embeddings into almost self-centered graphs of given radius"],"prefix":"10.1007","volume":"36","author":[{"given":"Kexiang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Haiqiong","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Kinkar Ch.","family":"Das","sequence":"additional","affiliation":[]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"key":"311_CR1","doi-asserted-by":"publisher","first-page":"1911","DOI":"10.11650\/twjm\/1500406804","volume":"16","author":"K Balakrishnan","year":"2012","unstructured":"Balakrishnan K, Bre\u0161ar B, Changat M, Klav\u017ear S, Peterin I, Subhamathi AR (2012) Almost self-centered median and chordal graphs. Taiwan J Math 16:1911\u20131922","journal-title":"Taiwan J Math"},{"key":"311_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1111\/j.1749-6632.1989.tb16384.x","volume":"576","author":"F Buckley","year":"1989","unstructured":"Buckley F (1989) Self-centered graphs, Graph Theory and Its Applications: East and West. Ann N Y Acad Sci 576:71\u201378","journal-title":"Ann N Y Acad Sci"},{"key":"311_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s10255-014-0294-y","volume":"30","author":"YK Cheng","year":"2014","unstructured":"Cheng YK, Kang LY, Yan H (2014) The backup 2-median problem on block graphs. Acta Math Appl Sin Engl Ser 30:309\u2013320","journal-title":"Acta Math Appl Sin Engl Ser"},{"key":"311_CR4","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/s10878-016-0092-y","volume":"34","author":"KC Das","year":"2017","unstructured":"Das KC, Nadjafi-Arani MJ (2017) On maximum Wiener index of trees and graphs with given radius. J Comb Optim 34:574\u2013587","journal-title":"J Comb Optim"},{"key":"311_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.26493\/1855-3974.237.48a","volume":"6","author":"KC Das","year":"2013","unstructured":"Das KC, Lee DW, Graovac A (2013) Some properties of the Zagreb eccentricity indices. ARS Math Contemp 6:117\u2013125","journal-title":"ARS Math Contemp"},{"key":"311_CR6","volume-title":"Graph theory","author":"R Diestel","year":"2006","unstructured":"Diestel R (2006) Graph theory. Springer, Berlin"},{"key":"311_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jmaa.2000.7243","volume":"266","author":"S Gupta","year":"2002","unstructured":"Gupta S, Singh M (2002) Application of graph theory: relationship of eccentric connectivity index and Wiener\u2019s index with anti-inflammatory activity. J Math Anal Appl 266:259\u2013268","journal-title":"J Math Anal Appl"},{"key":"311_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/S1093-3263(00)00027-9","volume":"18","author":"S Gupta","year":"2000","unstructured":"Gupta S, Singh M, Madan AK (2000) Connective eccentricity index: a novel topological descriptor for predicting biological activity. J Mol Graph Model 18:18\u201325","journal-title":"J Mol Graph Model"},{"key":"311_CR9","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/S0022-247X(02)00373-6","volume":"275","author":"S Gupta","year":"2002","unstructured":"Gupta S, Singh M, Madan AK (2002) Eccentric distance sum: a novel graph invariant for predicting biological and physical properties. J Math Anal Appl 275:386\u2013401","journal-title":"J Math Anal Appl"},{"key":"311_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2012.05.003","volume":"445","author":"YM Hong","year":"2012","unstructured":"Hong YM, Kang LY (2012) Backup 2-center on interval graphs. Theor Comput Sci 445:25\u201335","journal-title":"Theor Comput Sci"},{"key":"311_CR11","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0898-1221(00)00183-8","volume":"40","author":"TC Huang","year":"2000","unstructured":"Huang TC, Lin JC, Chen HJ (2000) A self-stabilizing algorithm which finds a 2-center of a tree. Comput Math Appl 40:607\u2013624","journal-title":"Comput Math Appl"},{"key":"311_CR12","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1016\/j.jmaa.2011.02.086","volume":"381","author":"A Ili\u0107","year":"2011","unstructured":"Ili\u0107 A, Yu G, Feng L (2011) On the eccentric distance sum of graphs. J Math Anal Appl 381:590\u2013600","journal-title":"J Math Anal Appl"},{"key":"311_CR13","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1007\/s10114-011-9628-3","volume":"27","author":"S Klav\u017ear","year":"2011","unstructured":"Klav\u017ear S, Narayankar KP, Walikar HB (2011) Almost self-centered graphs. Acta Math Sin (Engl Ser) 27:2343\u20132350","journal-title":"Acta Math Sin (Engl Ser)"},{"key":"311_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.11650\/tjm.18.2014.3267","volume":"18","author":"S Klav\u017ear","year":"2014","unstructured":"Klav\u017ear S, Narayankar KP, Walikar HB, Lokesh SB (2014) Almost-peripheral graphs. Taiwan J Math 18:463\u2013471","journal-title":"Taiwan J Math"},{"key":"311_CR15","doi-asserted-by":"publisher","first-page":"705","DOI":"10.11650\/tjm\/7889","volume":"21","author":"S Klav\u017ear","year":"2017","unstructured":"Klav\u017ear S, Liu H, Singh P, Xu K (2017) Constructing almost peripheral and almost self-centered graphs revisited. Taiwan J Math 21:705\u2013717","journal-title":"Taiwan J Math"},{"key":"311_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.dam.2015.01.007","volume":"186","author":"M Krnc","year":"2015","unstructured":"Krnc M, \u0160krekovski R (2015) Group centralization of network indices. Discrete Appl Math 186:147\u2013157","journal-title":"Discrete Appl Math"},{"key":"311_CR17","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.disc.2015.08.003","volume":"339","author":"A Maddaloni","year":"2016","unstructured":"Maddaloni A, Zamfirescu CT (2016) A cut locus for finite graphs and the farthest point mapping. Discrete Math 339:354\u2013364","journal-title":"Discrete Math"},{"key":"311_CR18","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1016\/j.disc.2009.12.013","volume":"311","author":"MJ Morgan","year":"2011","unstructured":"Morgan MJ, Mukwembi S, Swart HC (2011) On the eccentric connectivity index of a graph. Discrete Math 311:1229\u20131234","journal-title":"Discrete Math"},{"key":"311_CR19","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.dam.2014.11.010","volume":"184","author":"JL Palacios","year":"2015","unstructured":"Palacios JL (2015) On the Kirchhoff index of graphs with diameter 2. Discrete Appl Math 184:196\u2013201","journal-title":"Discrete Appl Math"},{"key":"311_CR20","doi-asserted-by":"publisher","first-page":"2890","DOI":"10.1016\/j.dam.2007.11.022","volume":"156","author":"J Puerto","year":"2008","unstructured":"Puerto J, Tamir A, Mesa JA, P\u00e9rez-Brito D (2008) Center location problems on tree graphs with subtree-shaped customers. Discrete Appl Math 156:2890\u20132910","journal-title":"Discrete Appl Math"},{"key":"311_CR21","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1021\/ci960049h","volume":"37","author":"V Sharma","year":"1997","unstructured":"Sharma V, Goswami R, Madan AK (1997) Eccentric connectivity index: a novel highly discriminating topological descriptor for structure-property and structure-activity studies. J Chem Inf Comput Sci 37:273\u2013282","journal-title":"J Chem Inf Comput Sci"},{"key":"311_CR22","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10878-013-9645-5","volume":"30","author":"G Su","year":"2015","unstructured":"Su G, Xiong L, Su X, Chen X (2015) Some results on the reciprocal sum-degree distance of graphs. J Comb Optim 30:435\u2013446","journal-title":"J Comb Optim"},{"key":"311_CR23","doi-asserted-by":"publisher","first-page":"2745","DOI":"10.1016\/j.disc.2008.06.031","volume":"309","author":"I Tomescu","year":"2008","unstructured":"Tomescu I (2008) Properties of connected graphs having minimum degree distance. Discrete Math 309:2745\u20132748","journal-title":"Discrete Math"},{"key":"311_CR24","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1016\/j.dam.2010.05.023","volume":"158","author":"I Tomescu","year":"2010","unstructured":"Tomescu I (2010) Ordering connected graphs having small degree distances. Discrete Appl Math 158:1714\u20131717","journal-title":"Discrete Appl Math"},{"key":"311_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/net.20261","volume":"53","author":"HL Wang","year":"2009","unstructured":"Wang HL, Wu B, Chao KM (2009) The backup 2-center and backup 2-median problems on trees. Networks 53:39\u201349","journal-title":"Networks"},{"key":"311_CR26","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10878-012-9479-6","volume":"26","author":"B Wu","year":"2013","unstructured":"Wu B, An X, Liu G, Yan G, Liu X (2013) Minimum degree, edge-connectivity and radius. J Comb Optim 26:585\u2013591","journal-title":"J Comb Optim"},{"key":"311_CR27","first-page":"461","volume":"71","author":"K Xu","year":"2014","unstructured":"Xu K, Liu M, Das KC, Gutman I, Furtula B (2014) A survey on graphs extremal with respect to distance-based topological indices. MATCH Commun Math Comput Chem 71:461\u2013508","journal-title":"MATCH Commun Math Comput Chem"},{"key":"311_CR28","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1016\/j.jmaa.2015.08.027","volume":"433","author":"K Xu","year":"2016","unstructured":"Xu K, Das KC, Liu H (2016) Some extremal results on the connective eccentricity index of graphs. J Math Anal Appl 433:803\u2013817","journal-title":"J Math Anal Appl"},{"key":"311_CR29","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1007\/s10114-016-5518-z","volume":"32","author":"K Xu","year":"2016","unstructured":"Xu K, Das KC, Maden AD (2016) On a novel eccentricity-based invariant of a graph. Acta Math Sin (Engl Ser) 32:1477\u20131493","journal-title":"Acta Math Sin (Engl Ser)"},{"key":"311_CR30","first-page":"611","volume":"69","author":"G Yu","year":"2013","unstructured":"Yu G, Feng L (2013) On the connective eccentricity index of graphs. MATCH Commun Math Comput Chem 69:611\u2013628","journal-title":"MATCH Commun Math Comput Chem"},{"key":"311_CR31","doi-asserted-by":"publisher","first-page":"1776","DOI":"10.1016\/j.jmaa.2014.06.050","volume":"420","author":"G Yu","year":"2014","unstructured":"Yu G, Qu H, Tang L, Feng L (2014) On the connective eccentricity index of trees and unicyclic graphs with given diameter. J Math Anal Appl 420:1776\u20131786","journal-title":"J Math Anal Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0311-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0311-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0311-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T16:02:24Z","timestamp":1589904144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0311-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,30]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["311"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0311-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,30]]},"assertion":[{"value":"30 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}