{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T16:52:15Z","timestamp":1773766335882,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,3,3]],"date-time":"2012-03-03T00:00:00Z","timestamp":1330732800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-012-1143-5","type":"journal-article","created":{"date-parts":[[2012,3,4]],"date-time":"2012-03-04T01:50:11Z","timestamp":1330825811000},"page":"449-462","source":"Crossref","is-referenced-by-count":21,"title":["Degree Distance of Unicyclic Graphs with Given Matching Number"],"prefix":"10.1007","volume":"29","author":[{"given":"Lihua","family":"Feng","sequence":"first","affiliation":[]},{"given":"Weijun","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Aleksandar","family":"Ili\u0107","sequence":"additional","affiliation":[]},{"given":"Guihai","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,3]]},"reference":[{"key":"1143_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan Press, New York (1976)"},{"key":"1143_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\u0103 S.M.: The minimum degree distance of graphs of given order and size. Discret. Appl. Math. 156, 3518\u20133521 (2008)","journal-title":"Discret. Appl. Math."},{"key":"1143_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":"1143_CR4","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. Discret. Appl. Math. 157, 2773\u20132777 (2009)","journal-title":"Discret. Appl. Math."},{"key":"1143_CR5","volume-title":"Molecular Topology","author":"M.V. Diudea","year":"2001","unstructured":"Diudea M.V., Gutman I., J\u00e4ntschi L.: Molecular Topology. Nova, Huntington (2001)"},{"key":"1143_CR6","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."},{"key":"1143_CR7","doi-asserted-by":"crossref","first-page":"1082","DOI":"10.1021\/ci00021a008","volume":"34","author":"A.A. 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":"1143_CR8","first-page":"101","volume":"63","author":"Z. Du","year":"2010","unstructured":"Du Z., Zhou B.: Minimum Wiener indices of trees and unicyclic graphs of given matching number. MATCH Commun. Math. Comput. Chem. 63, 101\u2013112 (2010)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"1143_CR9","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":"1143_CR10","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":"1143_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0024-3795(01)00465-7","volume":"342","author":"Y.P. 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":"1143_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., Yu G., Dankelmann P.: Degree distance of unicyclic and bicyclic graphs. Discret. Appl. Math. 159, 779\u2013788 (2011)","journal-title":"Discret. Appl. Math."},{"key":"1143_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":"1143_CR14","doi-asserted-by":"crossref","first-page":"2776","DOI":"10.1016\/j.camwa.2010.01.047","volume":"59","author":"A. Ili\u0107","year":"2010","unstructured":"Ili\u0107 A.: Trees with minimal Laplacian coefficients. Comp. Math. Appl. 59, 2776\u20132783 (2010)","journal-title":"Comp. Math. Appl."},{"key":"1143_CR15","unstructured":"McKay, B.: Nauty http:\/\/cs.anu.edu.au\/~bdm\/nauty\/"},{"key":"1143_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. Discret. Appl. Math. 98, 159\u2013163 (1999)","journal-title":"Discret. Appl. Math."},{"key":"1143_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. Discret. Math. 309, 2745\u20132748 (2009)","journal-title":"Discret. Math."},{"key":"1143_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.dam.2007.09.010","volume":"156","author":"A.I. Tomescu","year":"2008","unstructured":"Tomescu A.I.: Unicyclic and bicyclic graphs having minimum degree distance. Discret. Appl. Math. 156, 125\u2013130 (2008)","journal-title":"Discret. Appl. Math."},{"key":"1143_CR19","unstructured":"Tomescu, A.I.: Minimal graphs with respect to the degree distance, University of Bucharest. Technical report (2008). http:\/\/sole.dimi.uniud.it\/~alexandru.tomescu\/files\/dd-distance.pdf"},{"key":"1143_CR20","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."},{"key":"1143_CR21","first-page":"18","volume":"39","author":"H. Yuan","year":"2006","unstructured":"Yuan H., An C.: The unicyclic graphs with maximum degree distance. J. Math. Study 39, 18\u201324 (2006)","journal-title":"J. Math. Study"},{"key":"1143_CR22","first-page":"189","volume":"56","author":"B. Zhou","year":"2006","unstructured":"Zhou B.: Bounds for the Schultz molecular topological index. MATCH Commun. Math. Comput. Chem. 56, 189\u2013194 (2006)","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-012-1143-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1143-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1143-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:33Z","timestamp":1559055573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1143-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,3]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1143"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1143-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,3]]}}}