Narodna in univerzitetna knjižnica, Ljubljana (NUK)
Naročanje gradiva za izposojo na dom
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi
  • GCD-graphs and NEPS of complete graphs
    Klotz, Walter ; Sander, Torsten
    A gcd-graph is a Cayley graph over a finite abelian group defined by greatest common divisors. Such graphs are known to have integral spectrum. A non-complete extended ▫$p$▫-sum, or NEPS in short, is ... well-known general graph product. We show that the class of gcd-graphs and the class of NEPS of complete graphs coincide. Thus, a relation between the algebraically defined Cayley graphs and the combinatorially defined NEPS of complete graphs is established. We use this link to show that gcd-graphs have a particularly simple eigenspace structure, to be precise, that every eigenspace of the adjacency matrix of a gcd-graph has a basis with entries ▫$-1,0,1$▫ only.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 6, no. 2, 2013, str. 289-299)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2013
    Jezik - angleški
    COBISS.SI-ID - 16475225

vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 6, no. 2, 2013, str. 289-299)

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