{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:28Z","timestamp":1753884988871,"version":"3.41.2"},"reference-count":14,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271362"],"award-info":[{"award-number":["12271362"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:p> Let [Formula: see text] and [Formula: see text] be the vertex set and edge set of graph [Formula: see text]. Let [Formula: see text] be the distance between vertices [Formula: see text] and [Formula: see text] in the graph [Formula: see text] and [Formula: see text] be the graph obtained by deleting edge [Formula: see text] from [Formula: see text]. For a vertex set [Formula: see text] and an edge [Formula: see text], let [Formula: see text] be the set of pairs [Formula: see text] with a vertex [Formula: see text] and a vertex [Formula: see text] such that [Formula: see text]. A vertex set [Formula: see text] is distance-edge-monitoring set, introduced by Foucaud, Kao, Klasing, Miller, and Ryan, if every edge [Formula: see text] is monitored by some vertex of [Formula: see text], that is, the set [Formula: see text] is nonempty. In this paper, we determine the smallest size of distance-edge-monitoring sets of hierarchical and corona graphs. <\/jats:p>","DOI":"10.1142\/s0219265922500037","type":"journal-article","created":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T00:59:43Z","timestamp":1672361983000},"source":"Crossref","is-referenced-by-count":1,"title":["Distance-Edge-Monitoring Sets in Hierarchical and Corona Graphs"],"prefix":"10.1142","volume":"23","author":[{"given":"Gang","family":"Yang","sequence":"first","affiliation":[{"name":"College of Science, University of Shanghai for Science and Technology, Shanghai 200093, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changxiang","family":"He","sequence":"additional","affiliation":[{"name":"College of Science, University of Shanghai for Science and Technology, Shanghai 200093, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2022,12,28]]},"reference":[{"issue":"1","key":"S0219265922500037BIB001","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.jcss.2014.06.003","volume":"81","author":"Bampas E.","year":"2015","journal-title":"J. Comput. Syst. Sci."},{"key":"S0219265922500037BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.04.018"},{"key":"S0219265922500037BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884015"},{"issue":"14","key":"S0219265922500037BIB004","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1016\/j.tcs.2010.01.010","volume":"411","author":"Bil\u00f2 D.","year":"2010","journal-title":"Theor. Comput. Sci."},{"key":"S0219265922500037BIB005","first-page":"47","volume":"21","author":"Barik S.","year":"2007","journal-title":"Discrete Math."},{"issue":"1","key":"S0219265922500037BIB006","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/j.tcs.2005.12.009","volume":"355","author":"Dall\u2019Asta L.","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"S0219265922500037BIB007","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.dam.2021.07.002","volume":"319","author":"Foucaud F.","year":"2022","journal-title":"Discrete Appl. Math."},{"first-page":"1371","volume-title":"Proceedings of the th IEEE International Conference on Computer Communications (INFOCOM\u201900, 2000)","author":"Govindan R.","key":"S0219265922500037BIB008"},{"key":"S0219265922500037BIB009","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.056101"},{"key":"S0219265922500037BIB010","first-page":"163","volume":"38","author":"Liu Q.","year":"2014","journal-title":"J. Math."},{"key":"S0219265922500037BIB011","doi-asserted-by":"crossref","first-page":"11024","DOI":"10.1088\/1742-5468\/2015\/11\/P11024","author":"Lv Q.","year":"2015","journal-title":"J. Stat. Mech"},{"key":"S0219265922500037BIB012","doi-asserted-by":"crossref","first-page":"045103","DOI":"10.1103\/PhysRevE.67.045103","volume":"67","author":"Noh J. D.","year":"2003","journal-title":"Phys. Rev. E"},{"key":"S0219265922500037BIB013","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026112"},{"key":"S0219265922500037BIB014","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073374"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265922500037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,4]],"date-time":"2023-03-04T05:01:58Z","timestamp":1677906118000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265922500037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,28]]},"references-count":14,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["10.1142\/S0219265922500037"],"URL":"https:\/\/doi.org\/10.1142\/s0219265922500037","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2022,12,28]]},"article-number":"2250003"}}