0 KB177 KB31 KB200820252008Boutin, Debra L.letnik:1številka:2str. 154-164COBISSID:15147609ISSN:1855-3966URN:URN:NBN:SI:doc-2GK6WV3JenDruštvo matematikov, fizikov in astronomov SlovenijeArs mathematica contemporaneagrafimatematikateorija grafovSmall label classes in 2-distinguishing labelings|A graph ?$G$? is said to be 2-distinguishable if there is a labeling of the vertices with two labels so that only the trivial automorphism preserves the labels. Call the minimum size of a label class in such a labeling of ?$G$? the cost of 2-distinguishing ?$G$? and denote it by ?$\rho(G)$?. This paper shows that for ?$n \ge 5$?, ?$\lceil \log_2 n\rceil + 1 \le \rho(Q_n) \le 2\lceil \log_2n \rceil - 1$?, where ?$Q_n$? is the hypercube of dimension ?$n$?TEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije