DIKUL - logo
FMF in IMFM, Matematična knjižnica, Ljubljana (MAKLJ)
  • On the sum of ▫$k$▫ largest eigenvalues of graphs and symmetric matrices
    Mohar, Bojan
    Let ▫$k$▫ be a positive integer and let ▫$G$▫ be a graph of order ▫$n\ge k$▫. It is proved that the sum of ▫$k$▫ largest eigenvalues of ▫$G$▫ is at most ▫$\frac{1}{2}(\sqrt{k} + 1)n$▫. This bound is ... shown to be best possible in the sense that for every ▫$k$▫ there exist graphs whose sum is ▫$(\frac{1}{2}(\sqrt{k} + \frac{1}{2})n -o(k^{-2/5})n$▫. A generalization to arbitrary symmetric matrices is given.
    Vir: Journal of combinatorial theory. Series B. - ISSN 0095-8956 (Vol. 99, no. 2, 2009, str. 306-313)
    Vrsta gradiva - članek, sestavni del
    Leto - 2009
    Jezik - angleški
    COBISS.SI-ID - 15036505

    Povezava(-e):

    http://dx.doi.org/10.1016/j.jctb.2008.07.001

vir: Journal of combinatorial theory. Series B. - ISSN 0095-8956 (Vol. 99, no. 2, 2009, str. 306-313)

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

Vnos na polico