Some notes on spectra of cographs
Yükleniyor...
Dosyalar
Tarih
2011-07
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Charles Babbage Res Ctr
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
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.
Açıklama
Anahtar Kelimeler
Cograph, Characteristic polynomial, Eigenvalues, Polynomial reconstruction, Sigma-graph, Graphs, Algebraic connectivity, Graph in graph theory, Signless Laplacian
Kaynak
Ars Combinatoria
WoS Q Değeri
Q4
Scopus Q Değeri
Q4
Cilt
100
Sayı
Künye
Bıyıkoğlu, T., Simic, S. K. & Stanic, Z. (2011). Some notes on spectra of cographs. Ars Combinatoria, 100, 421-434.
