{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:09Z","timestamp":1753884969585,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> For a connected graph [Formula: see text] of order [Formula: see text] and a set [Formula: see text], the Steiner distance of [Formula: see text] is the minimum number of edges in a connected subgraph of [Formula: see text] containing [Formula: see text]. If [Formula: see text] is an integer, [Formula: see text] and a vertex [Formula: see text], the Steiner [Formula: see text]-eccentricity of a vertex [Formula: see text] of [Formula: see text], [Formula: see text], is the maximum Steiner distance of all [Formula: see text]-subsets of [Formula: see text] containing [Formula: see text]. The Steiner [Formula: see text]-radius of [Formula: see text], [Formula: see text], is the minimum Steiner [Formula: see text]-eccentricities of all vertices in [Formula: see text]. We give bounds on [Formula: see text] in terms of the order of [Formula: see text] and the minimum degree of [Formula: see text] for all graphs and for graphs that contain no triangles. We shall also investigate the relation between the [Formula: see text]-radius of a graph [Formula: see text] and its complement [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830922501592","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T12:10:01Z","timestamp":1663330201000},"source":"Crossref","is-referenced-by-count":0,"title":["Bounds on the Steiner radius of a graph"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6592-025X","authenticated-orcid":false,"given":"Patrick","family":"Ali","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, University of Malawi, Malawi"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edy Tri","family":"Baskoro","sequence":"additional","affiliation":[{"name":"Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung and the Collaborative Research Center for Graph Theory and Combinatorics, Indonesia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,10,4]]},"reference":[{"key":"S1793830922501592BIB001","doi-asserted-by":"crossref","first-page":"1845","DOI":"10.1016\/j.dam.2012.03.031","volume":"160","author":"Ali P.","year":"2012","journal-title":"Discrete Appl. Math."},{"volume-title":"Distance in Graphs","year":"1990","author":"Buckley F.","key":"S1793830922501592BIB002"},{"volume-title":"Graph Theory-An Algorithmic Approach","year":"1975","author":"Christofides N.","key":"S1793830922501592BIB003"},{"key":"S1793830922501592BIB004","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(89)90066-X","volume":"47","author":"Erd\u00f6s P.","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"S1793830922501592BIB005","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0933-1","volume-title":"Graph Theory Applications","author":"Foulds L. R.","year":"1992"},{"key":"S1793830922501592BIB006","first-page":"184","volume":"70","author":"Jordan C.","year":"1869","journal-title":"J. Reine Angew. Math."},{"key":"S1793830922501592BIB007","doi-asserted-by":"crossref","first-page":"1223","DOI":"10.1515\/ms-2015-0084","volume":"65","author":"Mazorodze J. P.","year":"2015","journal-title":"Math. Slovaca"},{"key":"S1793830922501592BIB008","first-page":"17","volume":"4","author":"Zhang L. X.","year":"1987","journal-title":"J. Xinjiang Univ. Natur. Sci."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501592","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:08:20Z","timestamp":1689930500000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,4]]},"references-count":8,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S1793830922501592"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501592","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,10,4]]},"article-number":"2250159"}}