Authors: Biyikoglu, Turker
Simić, Slobodan 
Stanić, Zoran
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Some notes on spectra of cographs
Journal: Ars Combinatoria
Volume: 100
First page: 421
Last page: 434
Issue Date: 1-Jul-2011
Rank: M23
ISSN: 0381-7032
Abstract: 
A cograph is a P4-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 √5-1/2 is unique.
Keywords: σ-graph | Characteristic polynomial | Cograph | Eigenvalues | Polynomial reconstruction
Publisher: Charles Babbage Research Centre

Show full item record

SCOPUSTM   
Citations

20
checked on Oct 2, 2022

Page view(s)

9
checked on Sep 14, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.