On the spectral characterization of pineapple graphs

DOI10.1016/J.LAA.2016.06.018MaRDI QIDQ306453zbMATH OpenOpenAlexFDO

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)

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

zbMATH Keywords

cospectral graphsspectral characterization

Mathematics Subject Classification ID

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

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)$.

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

Cites work

• Constructing cospectral graphs
• Cospectral graphs with least eigenvalue at least -2
• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• On spectral characterization and embeddings of graphs
• Some graphs determined by their spectra
• Spectral characterizations of almost complete graphs
• The Gewirtz graph: An exercise in the theory of graph spectra

Cited in

(19)

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

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)