{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:23Z","timestamp":1759063823100},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,2,19]],"date-time":"2015-02-19T00:00:00Z","timestamp":1424304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00373-015-1527-4","type":"journal-article","created":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T08:00:16Z","timestamp":1424246416000},"page":"2261-2274","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Degree Distance of Unicyclic Graphs with Given Matching Number"],"prefix":"10.1007","volume":"31","author":[{"given":"Shuchao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yibing","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huihui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,19]]},"reference":[{"key":"1527_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan Press, New York (1976)"},{"key":"1527_CR2","doi-asserted-by":"crossref","first-page":"3518","DOI":"10.1016\/j.dam.2008.03.036","volume":"156","author":"O Bucicovschi","year":"2008","unstructured":"Bucicovschi, O., Cioab\u01ce, S.M.: The minimum degree distance of graphs of given order and size. Discrete Appl. Math. 156, 3518\u20133521 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1527_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0024-3795(03)00394-X","volume":"370","author":"A Chang","year":"2003","unstructured":"Chang, A., Tian, F.: On the spectral radius of unicyclic graphs with perfect matching. Linear Algebra Appl. 370, 237\u2013250 (2003)","journal-title":"Linear Algebra Appl."},{"key":"1527_CR4","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1021\/ci00021a008","volume":"34","author":"AA Dobrynin","year":"1994","unstructured":"Dobrynin, A.A., Kochetova, A.A.: Degree distance of a graph: a degree analogue of the Wiener index. J. Chem. Inf. Comput. Sci. 34, 1082\u20131086 (1994)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"1527_CR5","doi-asserted-by":"crossref","first-page":"2773","DOI":"10.1016\/j.dam.2009.04.006","volume":"157","author":"P Dankelmann","year":"2009","unstructured":"Dankelmann, P., Gutman, I., Mukwembi, S., Swart, H.C.: On the degree distance of a graph. Discrete Appl. Math. 157, 2773\u20132777 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1527_CR6","volume-title":"Molecular Topology","author":"MV Diudea","year":"2001","unstructured":"Diudea, M.V., Gutman, I., J\u00e4ntschi, L.: Molecular Topology. Nova, Huntington (2001)"},{"key":"1527_CR7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1010767517079","volume":"66","author":"A Dobrynin","year":"2001","unstructured":"Dobrynin, A., Entringer, R., Gutman, I.: Wiener index of trees: theory and applications. Acta Appl. Math. 66, 211\u2013249 (2001)","journal-title":"Acta Appl. Math."},{"issue":"3","key":"1527_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s00373-012-1143-5","volume":"29","author":"LH Feng","year":"2013","unstructured":"Feng, L.H., Liu, W.J., Ili\u0107, A., Yu, G.H.: Degree distance of unicyclic graphs with given matching number. Graphs Comb. 29(3), 449\u2013462 (2013)","journal-title":"Graphs Comb."},{"key":"1527_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-70982-1","volume-title":"Mathematical Concepts in Organic Chemistry","author":"I Gutman","year":"1986","unstructured":"Gutman, I., Polansky, O.E.: Mathematical Concepts in Organic Chemistry. Springer, Berlin (1986)"},{"key":"1527_CR10","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1021\/ci00021a009","volume":"34","author":"I Gutman","year":"1994","unstructured":"Gutman, I.: Selected properties of the Schultz molecular topological index. J. Chem. Inf. Comput. Sci. 34, 1087\u20131089 (1994)","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"1527_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0024-3795(01)00465-7","volume":"342","author":"YP Hou","year":"2002","unstructured":"Hou, Y.P., Li, J.S.: Bounds on the largest eigenvalues of trees with a given size of matching. Linear Algebra Appl. 342, 203\u2013217 (2002)","journal-title":"Linear Algebra Appl."},{"key":"1527_CR12","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1016\/j.dam.2011.01.013","volume":"159","author":"A Ili\u0107","year":"2011","unstructured":"Ili\u0107, A., Stevanovi\u0107, D., Feng, L.H., Yu, G.H., Dankelmann, P.: Degree distance of unicyclic and bicyclic graphs. Discrete Appl. Math. 159, 779\u2013788 (2011)","journal-title":"Discrete Appl. Math."},{"key":"1527_CR13","first-page":"411","volume":"63","author":"A Ili\u0107","year":"2010","unstructured":"Ili\u0107, A., Klav\u017ear, S., Stevanovi\u0107, D.: Calculating the degree distance of partial Hamming graphs. MATCH Commun. Math. Comput. Chem. 63, 411\u2013424 (2010)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"1527_CR14","unstructured":"B. McKay, Nauty. http:\/\/cs.anu.edu.au\/bdm\/nauty\/"},{"key":"1527_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9783527613106","volume-title":"Handbook of Molecular Descriptors","author":"R Todeschini","year":"2000","unstructured":"Todeschini, R., Consonni, V.: Handbook of Molecular Descriptors. Wiley-VCH, Weinheim (2000)"},{"key":"1527_CR16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0166-218X(99)00117-1","volume":"98","author":"I Tomescu","year":"1999","unstructured":"Tomescu, I.: Some extremal properties of the degree distance of a graph. Discrete Appl. Math. 98, 159\u2013163 (1999)","journal-title":"Discrete Appl. Math."},{"key":"1527_CR17","doi-asserted-by":"crossref","first-page":"2745","DOI":"10.1016\/j.disc.2008.06.031","volume":"309","author":"I Tomescu","year":"2009","unstructured":"Tomescu, I.: Properties of connected graphs having minimum degree distance. Discrete Math. 309, 2745\u20132748 (2009)","journal-title":"Discrete Math."},{"key":"1527_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.dam.2007.09.010","volume":"156","author":"I Tomescu","year":"2008","unstructured":"Tomescu, I.: Unicyclic and bicyclic graphs having minimum degree distance. Discrete Appl. Math. 156, 125\u2013130 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1527_CR19","doi-asserted-by":"crossref","first-page":"1714","DOI":"10.1016\/j.dam.2010.05.023","volume":"158","author":"I Tomescu","year":"2010","unstructured":"Tomescu, I.: Ordering connected graphs having small degree distances. Discrete Appl. Math. 158, 1714\u20131717 (2010)","journal-title":"Discrete Appl. Math."},{"key":"1527_CR20","first-page":"425","volume":"67","author":"I Tomescu","year":"2012","unstructured":"Tomescu, I., Kanwal, S.: Ordering connected graphs having small degree distances. II. MATCH Commun. Math. Comput. Chem. 67, 425\u2013437 (2012)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"1527_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H Wiener","year":"1947","unstructured":"Wiener, H.: Structural determination of paraffin boiling point. J. Amer. Chem. Soc. 69, 17\u201320 (1947)","journal-title":"J. Amer. Chem. Soc."},{"key":"1527_CR22","first-page":"97","volume":"51","author":"A Yu","year":"2004","unstructured":"Yu, A., Tian, F.: On the spectral radius of unicyclic graphs. MATCH Commun. Math. Comput. Chem. 51, 97\u2013109 (2004)","journal-title":"MATCH Commun. Math. Comput. Chem."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1527-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1527-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1527-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:39Z","timestamp":1559055579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1527-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,19]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1527"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1527-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,19]]}}}