2000 character limit reached
Integral cographs and applications
Published 18 Feb 2019 in math.CO | (1902.06817v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.