The Kite Graph is Determined by Its Adjacency Spectrum
classification
🧮 math.CO
keywords
graphkiteadjacencydeterminedspectrumappendingcompletematrix
read the original abstract
The Kite graph $Kite_{p}^{q}$ is obtained by appending the complete graph $K_{p}$ to a pendant vertex of the path $P_{q}$. In this paper, the kite graph is proved to be determined by the spectrum of its adjacency matrix.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.