Eigenvalue location in cographs

Multiplicity of eigenvalues of cographs

Motivated by the linear time algorithm that locates the eigenvalues of a cograph G [10], we investigate the multiplicity of eigenvalue for λ\neq -1,0. For cographs with balanced cotrees we determine explicitly the highest value for the multiplicity.The energy of a graph is defined as the sum of absolute values of the eigenvalues. A graph G on n vertices is said to be borderenergetic if its energy equals the energy of the complete graph Kn. We present families of non-cospectral and borderenergetic cographs.

一种获取cograph（余图）拉普拉斯特征值的线性算法

A linear algorithm for obtaining the Laplacian eigenvalues of a cograph

该研究提出一种无需直接计算拉普拉斯矩阵特征值、可高效获取cograph拉普拉斯特征值的线性算法，并以此为工具推导出cograph生成树数目的闭式公式。

Cographs: Eigenvalues and Dilworth Number

A cograph is a simple graph which contains no path on 4 vertices as an induced subgraph. The vicinal preorder on the vertex set of a graph is defined in terms of inclusions among the neighborhoods of vertices. The minimum number of chains with respect to the vicinal preorder required to cover the vertex set of a graph $G$ is called the Dilworth number of $G$. We prove that for any cograph $G$, the multiplicity of any eigenvalue $λ\ne0,-1$, does not exceed the Dilworth number of $G$ and show that this bound is tight. G. F. Royle [The rank of a cograph, Electron. J. Combin. 10 (2003), Note 11] p…

Laplacian eigenvalues of equivalent cographs

Let G and H be equivalent cographs with their reduction R_G and R_H, and suppose the vertices of R_G and R_H are labeled by the twin numbers t_i of the k twin classes they represent. In this paper, we prove that G and H have at least k + \sum_{i\in I}(t_i-1) Laplacian eigenvalues in common, where I is the indices of the twin classes whose types are identical in G and H. This confirms the conjecture proposed by T. Abrishami \cite{Abris}. We also show that no two nonisomorphic equivalent cographs are L-cospectral.

Integral cographs and applications

A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we show a cograph that has a balanced cotree $T_{G}(a_{1},\ldots,a_{r-1},0|0,\ldots,0,a_{r})$ is integral computing its spectrum. As an application, these integral cographs can be used to estimate the eigenvalues of any cograph.

Spectral properties of cographs and $P_5$-free graphs

A cograph is a simple graph which contains no path on 4 vertices as an induced subgraph. We consider the eigenvalues of adjacency matrices of cographs and prove that a graph $G$ is a cograph if and only if no induced subgraph of $G$ has an eigenvalue in the interval $(-1,0)$. It is also shown that the multiplicity of any eigenvalue of a cograph $G$ does not exceed the sum of multiplicities of $0$ and $-1$ as eigenvalues of $G$. We introduce a partial order on the vertex set of graphs $G$ in terms of inclusions among the open and closed neighborhoods of vertices, and conjecture that the multipl…