0 KB320 KB47 KB200820252012Woestijne, Christiaan van deštevilka:2letnik:5str. 307-323COBISSID:16277337ISSN:1855-3966URN:URN:NBN:SI:doc-OYS1N4KGenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneafactorisationfaktorizacijagrafgraph theorygraphsmonoidimonoidsteorija grafovFactors of disconnected graphs and polynomials with nonnegative integer coefficients|We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has ?$n$? connected components, where ?$n$? is prime, or ?$n = 1, 4, 8, 9$?, and satisfies some additional natural conditions, it factors uniquely under the given products. If, on the contrary, ?$n = 6$?$ or 10, all cases of nonunique factorisation are described preciselyTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije