{"?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-VPH7KPFJ/f64cbaa5-59ff-4684-bbef-095e91d8bbc6/PDF","dcterms:extent":"441 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-VPH7KPFJ/24453a3a-ad92-4ad6-a14a-01cf36fa7f15/TEXT","dcterms:extent":"0 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:DOC-VPH7KPFJ/40f4d808-547e-4890-9b99-639fcfe65a4b/PDF","dcterms:extent":"179 KB"}],"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:DOC-VPH7KPFJ","dcterms:issued":"2025","dc:creator":["Imrich, Wilfried","Klep, Igor","Smertnig, Daniel"],"dc:format":[{"@xml:lang":"sl","#text":"številka:1, article  p1.11"},{"@xml:lang":"sl","#text":"18 str."},{"@xml:lang":"sl","#text":"letnik:8"}],"dc:identifier":["DOI:10.26493/2590-9770.1816.e85","COBISSID_HOST:234550019","ISSN:2590-9770","URN:URN:NBN:SI:doc-VPH7KPFJ"],"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":"cancellation property"},{"@xml:lang":"en","#text":"graph products"},{"@xml:lang":"en","#text":"monoid algebras"},{"@xml:lang":"en","#text":"power series rings"},{"@xml:lang":"en","#text":"uniqueness of roots"}],"dc:title":{"@xml:lang":"sl","#text":"Monoid algebras and graph products|"},"dc:description":{"@xml:lang":"sl","#text":"In this note, we extend results about unique ?$n^{\\rm th}$? roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for graphs with countably many finite connected components, as long as every connected component appears only finitely often (up to isomorphism). The proofs are via monoid algebras and generalized power series rings"},"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-VPH7KPFJ","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:DOC-VPH7KPFJ"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:DOC-VPH7KPFJ/f64cbaa5-59ff-4684-bbef-095e91d8bbc6/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-VPH7KPFJ/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:DOC-VPH7KPFJ"}}}}