DIKUL - logo
(UL)
  • Small label classes in 2-distinguishing labelings
    Boutin, Debra L.
    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$▫.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 1, no. 2, 2008, str. 154-164)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2008
    Jezik - angleški
    COBISS.SI-ID - 15147609

    Povezava(-e):

    http://amc.imfm.si/index.php/amc/article/viewFile/31/47
    Digitalna knjižnica Slovenije - dLib.si

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 1, no. 2, 2008, str. 154-164)

loading ...
loading ...
loading ...

Vnos na polico