The Graphs Which Are Cospectral with the Generalized Pineapple Graph
Abstract
Let p,k,q be positive integers with p−2⩾k, and let Kp,kq denote the generalized pineapple graph which is obtained by joining an independent set of q vertices with k vertices of a complete graph Kp. H. Topcu et al. previously constructed graphs that are cospectral with Kp,1q. In this paper, we determine all graphs that are cospectral with Kp,kq by analyzing the eigenvalues of its adjacency matrix.
Fields of Study & Subjects
Graph theory and applications
Graph Labeling and Dimension Problems
graph theory and CDMA systems
Publication details
- Journal / source
- Mathematics
- Publisher
- MDPI AG
- Volume
- 14
- Issue
- 8
- Pages
- 1265–1265
- Publication date
- 10 April 2026
- Language
- EN