0 KB286 KB45 KB200820252012Fisher, Michael J.Isaak, Garthštevilka:1letnik:5str. 159-173COBISSID:16273241ISSN:1855-3966URN:URN:NBN:SI:doc-57GKR2OGenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneaCartesian productcomplete graphdistinguishing numbergraph theorykartezični produktpoln grafrazlikovalno številoteorija grafovDistinguishing numbers of Cartesian products of multiple complete graphs|We examine the distinguishing number of the Cartesian product of an arbitrary number of complete graphs. We show that for ?$u_1 \le \dots \le u_d$? the distinguishing number of the Cartesian product of complete graphs of these sizes is either ?$\lceil u_d^{1/s} \rceil$? or ?$\lceil u_d^{1/s} \rceil + 1$? where ?$s = \prod_{i=1}^{d-1} u_i$?. In most cases, which of these values it is can be explicitly determinedTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije