Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | Keywords |
|---|---|---|
2011 | ARS COMBINATORIA | cograph,characteristic polynomial,eigenvalues,polynomial reconstruction,sigma-graph |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Polynomial,Vertex (geometry),Spectral line,If and only if,Cograph,Eigenvalues and eigenvectors,Mathematics | Journal | 100 |
ISSN | Citations | PageRank |
0381-7032 | 4 | 0.55 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Türker Bíyíkoglu | 1 | 88 | 7.40 |
| Slobodan K. Simic | 2 | 22 | 4.91 |
| Zoran Stanic | 3 | 4 | 0.88 |