{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T23:01:48Z","timestamp":1776812508375,"version":"3.51.2"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"vor","delay-in-days":297,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002923","name":"Consejo Nacional de Investigaciones Cient\u00edficas y T\u00e9cnicas","doi-asserted-by":"publisher","award":["1900"],"award-info":[{"award-number":["1900"]}],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Slovenian Research and Innovation Agency","doi-asserted-by":"publisher","award":["P1-0297"],"award-info":[{"award-number":["P1-0297"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009573","name":"Universidad Nacional de Rosario","doi-asserted-by":"publisher","award":["PID 80020210300068UR"],"award-info":[{"award-number":["PID 80020210300068UR"]}],"id":[{"id":"10.13039\/100009573","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021778","name":"Agencia Nacional De Promoci\u00f3n Cient\u00edfica Y Tecnol\u00f3gica","doi-asserted-by":"publisher","award":["PICT-2020-03032"],"award-info":[{"award-number":["PICT-2020-03032"]}],"id":[{"id":"10.13039\/501100021778","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.10.302","type":"journal-article","created":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T08:19:08Z","timestamp":1764058748000},"page":"223-230","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Domination in Johnson graphs"],"prefix":"10.1016","volume":"273","author":[{"given":"Mar\u00eda Gracia","family":"Cornet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Dravec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.procs.2025.10.302_bib1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.disc.2017.08.022","article-title":"On the girth and diameter of generalized Johnson graphs","volume":"341","author":"Agong","year":"2018","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.procs.2025.10.302_bib2","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.1109\/18.59932","article-title":"A new table of constant weight codes","volume":"36","author":"Brouwer","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.procs.2025.10.302_bib3","unstructured":"Delsarte, P., 1973. An algebraic approach to the association schemes of coding theory. Philips Res. Rep. Suppl. 10, vi+\u201397."},{"key":"10.1016\/j.procs.2025.10.302_bib4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","article-title":"Intersection theorems for systems of finite sets","volume":"12","author":"Erd\u00f6s","year":"1961","journal-title":"Quart. J. Math. Oxford"},{"key":"10.1016\/j.procs.2025.10.302_bib5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(96)00104-7","article-title":"On the chromatic number, colorings, and codes of the Johnson graph","volume":"70","author":"Etzion","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.procs.2025.10.302_bib6","doi-asserted-by":"crossref","first-page":"2156","DOI":"10.1109\/TIT.2004.833355","article-title":"Perfect constant-weight codes","volume":"50","author":"Etzion","year":"2004","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/j.procs.2025.10.302_bib7","doi-asserted-by":"crossref","first-page":"709","DOI":"10.2140\/pjm.1958.8.709","article-title":"Minimal coverings of pairs by triples","volume":"8","author":"Fort","year":"1958","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/j.procs.2025.10.302_bib8","series-title":"Erdos\u2013Ko\u2013Rado theorems: algebraic approaches. volume 149","author":"Godsil","year":"2015"},{"key":"10.1016\/j.procs.2025.10.302_bib9","doi-asserted-by":"crossref","first-page":"4670","DOI":"10.1109\/TIT.2006.881744","article-title":"Perfect single error-correcting codes in the Johnson scheme","volume":"52","author":"Gordon","year":"2006","journal-title":"IEEE transactions on information theory"},{"key":"10.1016\/j.procs.2025.10.302_bib10","series-title":"Dominating sets in Kneser graphs. Master\u2019s thesis","author":"Gorodezky","year":"2007"},{"key":"10.1016\/j.procs.2025.10.302_bib11","series-title":"Covering designs and domination in Kneser graphs","author":"Hartman","year":"2003"},{"key":"10.1016\/j.procs.2025.10.302_bib12","series-title":"Domination in graphs: Core concepts","author":"Haynes","year":"2023"},{"key":"10.1016\/j.procs.2025.10.302_bib13","series-title":"Structures of domination in graphs. volume 66","author":"Haynes","year":"2021"},{"key":"10.1016\/j.procs.2025.10.302_bib14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.21136\/MB.1993.126050","article-title":"Domination in Kneser graphs","volume":"118","author":"Ivan\u010do","year":"1993","journal-title":"Mathematica Bohemica"},{"key":"10.1016\/j.procs.2025.10.302_bib15","doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen, S.F., 2025. On the clique covering numbers of Johnson graphs. Des. Codes Cryptogr. doi: 10.1007\/s10623-025-01663-3.","DOI":"10.1007\/s10623-025-01663-3"},{"key":"10.1016\/j.procs.2025.10.302_bib16","doi-asserted-by":"crossref","first-page":"449","DOI":"10.7151\/dmgt.1506","article-title":"The competition numbers of Johnson graphs","volume":"30","author":"Kim","year":"2010","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"10.1016\/j.procs.2025.10.302_bib17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","article-title":"Kneser\u2019s conjecture, chromatic number, and homotopy","volume":"25","author":"Lov\u00e1sz","year":"1978","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"10.1016\/j.procs.2025.10.302_bib18","first-page":"60","article-title":"Vraagstuk xxviii","volume":"10","author":"Mantel","year":"1907","journal-title":"Wiskundige Opgaven met de Oplossingen"},{"key":"10.1016\/j.procs.2025.10.302_bib19","series-title":"Coverings and packings","author":"Mills","year":"1992"},{"key":"10.1016\/j.procs.2025.10.302_bib20","doi-asserted-by":"crossref","first-page":"187","DOI":"10.26493\/1855-3974.491.b02","article-title":"Bounds on the domination number of Kneser graphs","volume":"9","author":"\u00d6sterg\u00e5rd","year":"2014","journal-title":"Ars Mathematica Contemporanea"},{"key":"10.1016\/j.procs.2025.10.302_bib21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/090765596","article-title":"The automorphism group of a Johnson graph","volume":"25","author":"Ramras","year":"2011","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"10.1016\/j.procs.2025.10.302_bib22","doi-asserted-by":"crossref","first-page":"2067","DOI":"10.2298\/FIL2307067Z","article-title":"On the Roman domination problem of some Johnson graphs","volume":"37","author":"Zec","year":"2023","journal-title":"Filomat"}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092503649X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S187705092503649X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:02:30Z","timestamp":1766156550000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S187705092503649X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":22,"alternative-id":["S187705092503649X"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.302","relation":{},"ISSN":["1877-0509"],"issn-type":[{"value":"1877-0509","type":"print"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Domination in Johnson graphs","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.10.302","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}