VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Bipartite density of cubic graphs: the case of equality
    Stevanović, Dragan, 1974-
    Recently, Berman and Zhang (Discrete Math. 260 (2003) 27) obtained an upper bound for the bipartite density of cubic graphs in terms of the smallest eigenvalue of an adjacency matrix and attempted to ... characterize graphs for which the upper bound is attained. Here we do characterize graphs for which the upper bound is attained, and correct a few errors from Berman and Zhang's paper.
    Vir: Discrete mathematics. - ISSN 0012-365X (Vol. 283, no. 1/3, 2004, str. 279-281)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2004
    Jezik - angleški
    COBISS.SI-ID - 2009573

vir: Discrete mathematics. - ISSN 0012-365X (Vol. 283, no. 1/3, 2004, str. 279-281)
loading ...
loading ...
loading ...