Yazar "Simic, Slobodan K." seçeneğine göre listele

Listeleniyor 1 - 1 / 1
  • Küçük Resim
    Yayın
    Some notes on spectra of cographs
    (Charles Babbage Res Ctr, 2011-07) Bıyıkoğlu, Türker; Simic, Slobodan K.; Stanic, Zoran
    A cograph is a P-4-free graph. We first give a short proof of the fact that 0 (-1) belongs to the spectrum of a connected cograph (with at least two vertices) if and only if it contains duplicate (resp. coduplicate) vertices. As a consequence, we next prove that the polynomial reconstruction of graphs whose vertex-deleted subgraphs have the second largest eigenvalue not exceeding root 5-1/2 is unique.