Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Distinguishing numbers of Cartesian products of multiple complete graphs
    Fisher, Michael J. ; Isaak, Garth, 1961-
    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 determined.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 5, no. 1, 2012, str. 159-173)
    Vrsta gradiva - članek, sestavni del
    Leto - 2012
    Jezik - angleški
    COBISS.SI-ID - 16273241