{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,27]],"date-time":"2025-12-27T21:10:08Z","timestamp":1766869808073,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A set of cycles $C_1,\\ldots ,C_k$ in a graph $G$ is said to identify the vertices $v$ if the sets $\\{j:v\\in C_j\\}$ are all nonempty and different. In this paper, bounds for the minimum possible $k$ are given when $G$ is the graph ${\\bf Z}_p^n$ endowed with the Lee or Hamming metric or $G$ is a complete bipartite graph.<\/jats:p>","DOI":"10.37236\/1700","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:29:51Z","timestamp":1578709791000},"source":"Crossref","is-referenced-by-count":5,"title":["On the Identification of Vertices Using Cycles"],"prefix":"10.37236","volume":"10","author":[{"given":"Petri","family":"Rosendahl","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2003,1,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1r7\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v10i1r7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:10:01Z","timestamp":1579324201000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v10i1r7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1,29]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2003,1,6]]}},"URL":"https:\/\/doi.org\/10.37236\/1700","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2003,1,29]]},"article-number":"R7"}}