{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:28Z","timestamp":1759063408142,"version":"3.37.3"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"9","license":[{"start":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T00:00:00Z","timestamp":1591056000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671156"],"award-info":[{"award-number":["11671156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,17]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Given a graph, the status of a vertex is the sum of the distances between the vertex and all other vertices. The minimum status of a graph is the minimum of statuses of all vertices of this graph. We give a sharp upper bound for the minimum status of a connected graph with fixed order and matching number (domination number, respectively) and characterize the unique trees achieving the bound. We also determine the unique tree such that its minimum status is as small as possible when order and matching number (domination number, respectively) are fixed.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa057","type":"journal-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T12:03:30Z","timestamp":1588593810000},"page":"1384-1392","source":"Crossref","is-referenced-by-count":5,"title":["Minimum Status, Matching and Domination of Graphs"],"prefix":"10.1093","volume":"64","author":[{"given":"Caixia","family":"Liang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Zhaoqing University, Zhaoqing 526061, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiyan","family":"Guo","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, South China Normal University, Guangzhou 510631, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2020,6,2]]},"reference":[{"year":"2006","author":"Aouchiche","article-title":"Comparaison automatis\u00e9e d\u2019invariants en th\u00e9orie des graphes","key":"2021091609314463800_ref1"},{"key":"2021091609314463800_ref2","first-page":"365","article-title":"Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants","volume":"58","author":"Aouchiche","year":"2007","journal-title":"Math. Comput. Chem."},{"key":"2021091609314463800_ref3","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/net.20450","article-title":"Proximity and remoteness in graphs: results and conjectures","volume":"58","author":"Aouchiche","year":"2011","journal-title":"Networks"},{"key":"2021091609314463800_ref4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.laa.2014.06.010","article-title":"Distance spectra of graphs: a survey","volume":"458","author":"Aouchiche","year":"2014","journal-title":"Linear Algebra Appl."},{"key":"2021091609314463800_ref5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.dam.2016.04.031","article-title":"Proximity, remoteness and distance eigenvalues of a graph","volume":"213","author":"Aouchiche","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"2021091609314463800_ref6","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.disopt.2014.01.002","article-title":"Equal opportunity networks, distance-balanced graphs, and Wiener game","volume":"12","author":"Balakrishnan","year":"2014","journal-title":"Discrete Optim."},{"key":"2021091609314463800_ref7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/jgt.3190030306","article-title":"Graph-theoretic parameters concerning domination, independence, and irredundance","volume":"3","author":"Bollob\u00e1s","year":"1979","journal-title":"J. Graph Theory"},{"key":"2021091609314463800_ref8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(84)90127-4","article-title":"Permanent of the Laplacian matrix of trees and bipartite graphs","volume":"48","author":"Brualdi","year":"1984","journal-title":"Discrete Math."},{"volume-title":"Distance in Graphs","year":"1990","author":"Buckley","key":"2021091609314463800_ref9"},{"key":"2021091609314463800_ref10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.dam.2014.11.012","article-title":"Proximity, remoteness and minimum degree","volume":"184","author":"Dankelmann","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"2021091609314463800_ref11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(97)00067-X","article-title":"Average distance and domination number","volume":"80","author":"Dankelmann","year":"1997","journal-title":"Discrete Appl. Math."},{"key":"2021091609314463800_ref12","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.disc.2018.09.015","article-title":"Infinite family of transmission irregular trees of even order","volume":"342","author":"Dobrynin","year":"2019","journal-title":"Discrete Math."},{"volume-title":"Fundamentals of Domination in Graphs","year":"1998","author":"Haynes","key":"2021091609314463800_ref13"},{"key":"2021091609314463800_ref14","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1016\/j.dam.2009.04.009","article-title":"Domination, radius, and minimum degree","volume":"157","author":"Henning","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"2021091609314463800_ref15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(75)90055-1","article-title":"Some properties of a centroid of a free tree","volume":"4","author":"Kang","year":"1975\/76","journal-title":"Information Processing Lett."},{"key":"2021091609314463800_ref16","doi-asserted-by":"crossref","first-page":"2412","DOI":"10.1016\/j.disc.2015.06.011","article-title":"Centralization of transmission in networks","volume":"338","author":"Krnc","year":"2015","journal-title":"Discrete Math."},{"key":"2021091609314463800_ref17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10878-011-9412-4","article-title":"Minimum statuses of connected graphs with fixed maximum degree and order","volume":"24","author":"Lin","year":"2012","journal-title":"J. Comb. Optim."},{"key":"2021091609314463800_ref18","first-page":"277","article-title":"Maximum variances and minimum statuses of connected weighted graphs","volume":"104","author":"Lin","year":"2017","journal-title":"Util. Math."},{"volume-title":"Matching Theory","year":"1986","author":"Lov\u00e1sz","key":"2021091609314463800_ref19"},{"key":"2021091609314463800_ref20","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1142\/S0129054115500422","article-title":"Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs","volume":"26","author":"Neggazi","year":"2015","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"2021091609314463800_ref21","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"Ore","year":"1962"},{"key":"2021091609314463800_ref22","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1002\/net.21558","article-title":"Bounds on the radius and status of graphs","volume":"64","author":"Rissner","year":"2014","journal-title":"Networks"},{"key":"2021091609314463800_ref23","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.2298\/FIL1308425S","article-title":"Remoteness, proximity and few other distance invariants in graphs","volume":"27","author":"Sedlar","year":"2013","journal-title":"Filomat"},{"key":"2021091609314463800_ref24","first-page":"87","article-title":"Medians and peripherians of trees","volume":"4","author":"Zelinka","year":"1968","journal-title":"Arch. Math. (Brno)"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/9\/1384\/40393141\/bxaa057.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/64\/9\/1384\/40393141\/bxaa057.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:32:18Z","timestamp":1631784738000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/64\/9\/1384\/5848717"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,2]]},"references-count":24,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2020,6,2]]},"published-print":{"date-parts":[[2021,9,17]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa057","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2021,9]]},"published":{"date-parts":[[2020,6,2]]}}}