{"?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-4YW9ILEC/b16b243e-5923-4fe2-affa-cc1e69d444c2/PDF","dcterms:extent":"451 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-4YW9ILEC/6ce782c1-2f60-4fe5-9217-b42fc4787203/TEXT","dcterms:extent":"50 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-4YW9ILEC/b0ab074c-ca1e-449e-8b67-132b26dd59fe/PDF","dcterms:extent":"112 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-4YW9ILEC/02c1747b-4c6a-4e1c-8f26-0a9150ed7ba4/TEXT","dcterms:extent":"3 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-4YW9ILEC","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2023","dc:creator":["He, Xin","Zhang, Heping"],"dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:23"},{"@xml:lang":"sl","#text":"P2.09 (20 str.)"}],"dc:identifier":["DOI:10.26493/1855-3974.2706.3c8","COBISSID_HOST:151964675","ISSN:1855-3966","URN:URN:NBN:SI:doc-4YW9ILEC"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"sl","#text":"ciklomatsko število"},{"@xml:lang":"en","#text":"complete forcing number"},{"@xml:lang":"en","#text":"cyclomatic number"},{"@xml:lang":"en","#text":"cylinder"},{"@xml:lang":"en","#text":"global forcing number"},{"@xml:lang":"sl","#text":"globalno določitveno število"},{"@xml:lang":"sl","#text":"kolo"},{"@xml:lang":"en","#text":"perfect matching"},{"@xml:lang":"sl","#text":"polno določitveno število"},{"@xml:lang":"sl","#text":"popolno prirejanje"},{"@xml:lang":"sl","#text":"valj"},{"@xml:lang":"en","#text":"wheel"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Complete forcing numbers of graphs|"},"dc:description":[{"@xml:lang":"sl","#text":"The complete forcing number of a graph ?$G$? with a perfect matching is the minimum cardinality of an edge set of ?$G$? on which the restriction of each perfect matching ?$M$? is a forcing set of ?$M$?. This concept can be view as a strengthening of the concept of global forcing number of ?$G$?. T. Došlić J. Math. Chem. 41, No. 3, 217-229 (2007) has obtained that the global forcing number of a connected graph is at most its cyclomatic number. Motivated from this result, we obtain that the complete forcing number of a graph is no more than ?$2$? times its cyclomatic number and characterize the matching covered graphs whose complete forcing numbers attain this upper bound and minus one, respectively. Besides, we present a method of constructing a complete forcing set of a graph. By using such method, we give closed formulas for the complete forcing numbers of wheels and cylinders"},{"@xml:lang":"sl","#text":"Polno določitveno število grafa ?$G$? s popolnim prirejanjem je minimalna moč množice povezav grafa ?$G$?, za katero je zožitev vsakega popolnega prirejanja ?$M$? določitvena množica za ?$M$?. Ta koncept lahko gledamo kot nadgradnjo koncepta globalnega določitvenega števila grafa ?$G$?. Došlić je leta 2007 dokazal, da je globalno določitveno število povezanega grafa manjše ali kvečjemu enako njegovemu ciklomatskemu številu. Motivirani s tem rezultatom pokažemo, da polno določitveno število grafa ni večje od 2-kratnika njegovega ciklomatskega števila, in karakteriziramo s prirejanji pokrite grafe, katerih polno določitveno število doseže to zgornjo mejo, oziroma je za ena manjše. Predstavimo tudi metodo konstruiranja polne določitvene množice grafa. S pomočjo te metode izpeljemo sklenjene formule za polna določitvena števila koles in valjev"}],"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-4YW9ILEC","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-4YW9ILEC"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-4YW9ILEC/b16b243e-5923-4fe2-affa-cc1e69d444c2/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-4YW9ILEC/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-4YW9ILEC"}}}}