The graphs which are cospectral with the generalized pineapple graph
Abstract
Let p, k, q be positive integers with p-2 ≥slant k and let Kp,kq be the generalized pineapple graph which is obtained by joining independent set of q vertices with k vertices of a complete graph Kp. In TSH2, Haemers et al. constructed graphs which cospectral with Kp,1q. In this paper, we determine all graphs which are cospectral with Kp,kq by considering the eigenvalues of its adjacency matrix. Moreover, We extend the conclusions of Haemers et al. to a broader context.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.