{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-1SK2M1ZU/a5f4a85b-ce9a-40c6-ae9b-cd880706443c/PDF","dcterms:extent":"378 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-1SK2M1ZU/0c6c0058-35f6-49a4-bd6b-6ae7315488ba/TEXT","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-1SK2M1ZU/d2f0e92e-2350-4952-8b7e-edeae0d83ded/PDF","dcterms:extent":"217 KB"}],"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:DOC-1SK2M1ZU","dcterms:issued":"2025","dc:creator":["Araujo-Pardo, Gabriela","Conder, Marston D. E.","García-Colín, Natalia","Kiss, György","Leemans, Dimitri"],"dc:format":[{"@xml:lang":"sl","#text":"številka:3, article  p3.06"},{"@xml:lang":"sl","#text":"letnik:8"},{"@xml:lang":"sl","#text":"str. 1-7"}],"dc:identifier":["DOI:10.26493/2590-9770.1743.19f","COBISSID_HOST:238839043","ISSN:2590-9770","URN:URN:NBN:SI:doc-1SK2M1ZU"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:source":{"@xml:lang":"sl","#text":"The art of discrete and applied mathematics"},"dc:subject":[{"@xml:lang":"en","#text":"cages"},{"@xml:lang":"en","#text":"degree-diameter problem"},{"@xml:lang":"en","#text":"girth"}],"dc:title":{"@xml:lang":"sl","#text":"A note on girth-diameter cages|"},"dc:description":{"@xml:lang":"sl","#text":"In this paper we introduce a problem closely related to the Cage Problem and the Degree Diameter Problem. For integers k ? 2, g ? 3 and d ? 1, we define a (k; g, d)-graph to be a k-regular graph with girth g and diameter d. We denote by n0(k; g, d) the smallest possible order of such a graph, and, if such a graph exists, we call it a (k; g, d)-cage. In particular, we focus on (k; 5, 4)-graphs. We show that n0(k; 5, 4) ? k2 + k + 2 for all k, and report on the determination of all (k; 5, 4)-cages for k = 3, 4 and 5 and of examples with k = 6, and describe some examples of (k; 5, 4)-graphs which prove that n0(k; 5, 4) ? 2k2 for infinitely many k"},"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:DOC-1SK2M1ZU","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-1SK2M1ZU"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-1SK2M1ZU/a5f4a85b-ce9a-40c6-ae9b-cd880706443c/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:DOC-1SK2M1ZU/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-1SK2M1ZU"}}}}