On the spectral characterization of pineapple graphs

DOI10.1016/J.LAA.2016.06.018zbMATH Open1343.05098arXiv1511.08674OpenAlexW2962933976MaRDI QIDQ306453FDOQ306453

Authors: Hatice Topcu, Sezer Sorgun, Willem H. Haemers 

Publication date: 31 August 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: The pineapple graph $K_p^q$ is obtained by appending $q$ pendant edges to a vertex of a complete graph $K_p$ ($qgeq1,pgeq3$). Zhang and Zhang ["Some graphs determined by their spectra", Linear Algebra and its Applications, 431 (2009) 1443-1454] claim that the pineapple graphs are determined by their adjacency spectrum. We show that their claim is false by constructing graphs which are cospectral and non-isomorphic with $K_p^q$ for every $pgeq4$ and various values of $q$. In addition we prove that the claim is true if $q=2$, and refer to the literature for $q=1$, $p=3$, and $(p,q)=(4,3)$.

Full work available at URL: https://arxiv.org/abs/1511.08674

Recommendations

• The graphs cospectral with the pineapple graph
• Spectral characterizations of lollipop graphs
• Some graphs determined by their spectra
• The kite graph is determined by its adjacency spectrum
• On the spectral characterizations of graphs

zbMATH Keywords

cospectral graphsspectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Title not available (Why is that?)
• Constructing cospectral graphs
• Spectral characterizations of almost complete graphs
• The Gewirtz graph: An exercise in the theory of graph spectra
• Some graphs determined by their spectra
• Cospectral graphs with least eigenvalue at least \(-2\)
• On spectral characterization and embeddings of graphs

Cited In (17)

• On the spectral radius of block graphs with prescribed independence number \(\alpha\)
• On the spectral characterization of mixed extensions of \(P_3\)
• The graphs cospectral with the pineapple graph
• The kite graph is determined by its adjacency spectrum
• Signless Laplacian spectral characterization of some disjoint union of graphs
• The signless Laplacian spectral radius of some strongly connected digraphs
• Infinite families of connected graphs with equal spectral radius
• \(\mathrm{Kite}_{p+2,p}\) is determined by its Laplacian spectrum
• A combinatorial formula for the Schur coefficients of chromatic symmetric functions
• On the spectra of generalized fibonomial and Jacobsthal-binomial graphs
• The adjacency spectra of some families of minimally connected prime graphs
• Zero forcing number of degree splitting graphs and complete degree splitting graphs
• Spectral characterization of the complete graph removing a path of small length
• On two problems related to anti-adjacency (eccentricity) matrix
• A note on non-\(\mathbb{R}\)-cospectral graphs
• Some graphs determined by their signless Laplacian (distance) spectra
• New families of graphs determined by their generalized spectrum

This page was built for publication: On the spectral characterization of pineapple graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306453)