{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:01:18Z","timestamp":1775066478900,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>Locating-dominating sets and identifying codes are two closely related notions in the area of separating systems. Roughly speaking, they consist in a dominating set of a graph such that every vertex is uniquely identified by its neighbourhood within the dominating set. In this paper, we study the size of a smallest locating-dominating set or identifying code for graphs of girth at least 5 and of given minimum degree. We use the technique of vertex-disjoint paths to provide upper bounds on the minimum size of such sets, and construct graphs who come close to meeting these bounds.<\/jats:p>","DOI":"10.37236\/4562","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T00:08:17Z","timestamp":1578701297000},"source":"Crossref","is-referenced-by-count":9,"title":["Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5"],"prefix":"10.37236","volume":"22","author":[{"given":"Camino","family":"Balbuena","sequence":"first","affiliation":[]},{"given":"Florent","family":"Foucaud","sequence":"additional","affiliation":[]},{"given":"Adriana","family":"Hansberg","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2015,4,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i2p15\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v22i2p15\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T10:17:40Z","timestamp":1579256260000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v22i2p15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,29]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2015,4,14]]}},"URL":"https:\/\/doi.org\/10.37236\/4562","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,29]]},"article-number":"P2.15"}}