VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Distance spectrum of graph compositions
    Indulal, Gopalapillai
    The ▫$D$▫-eigenvalues ▫$\{\mu_1, \mu_2, ..., \mu_p\}$▫ of a graph $G$ are the eigenvalues of its distance matrix ▫$D$▫ and form the distance spectrum or ▫$D$▫-spectrum of ▫$G$▫ denoted by ... ▫$spec_D(G)$▫. In this paper we obtain the ▫$D$▫-spectrum of the cartesian product of two distance regular graphs. The ▫$D$▫-spectrum of the lexicographic product ▫$G[H]$▫ of two graphs ▫$G$▫ and ▫$H$▫ when ▫$H$▫ is regular is also obtained. The ▫$D$▫-eigenvalues of the Hamming graphs ▫$Ham(d,n)$▫ of diameter ▫$d$▫ and order ▫$n^d$▫ and those of the ▫$C_4$▫ nanotori, ▫$T_{k,m,C_4}$▫ are determined.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 2, no. 1, 2009, str. 93-100)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15490649