On the spectral characterization of kite graphs

MaRDI QIDQ5241115zbMATH OpenFDO

Authors Sezer Sorgun, Hatice Topcu

Publication date 30 October 2019

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

zbMATH Keywords

cospectral graphsclique numberkite graphdetermined by adjacency spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Abstract: The extit{Kite graph}, denoted by $Kit{e}_{p,q}$ is obtained by appending a complete graph $K_p$ to a pendant vertex of a path $P_q$. In this paper, firstly we show that no two non-isomorphic kite graphs are cospectral w.r.t adjacency matrix. Let $G$ be a graph which is cospectral with $Kit{e}_{p,q}$ and the clique number of $G$ is denoted by $w(G)$. Then, it is shown that $w(G)geqp-2q+1$. Also, we prove that $Kit{e}_{p,2}$ graphs are determined by their adjacency spectrum.

Recommendations

• The kite graph is determined by its adjacency spectrum
• \(\mathrm{Kite}_{p+2,p}\) is determined by its Laplacian spectrum
• Kite graphs determined by their spectra
• scientific article; zbMATH DE number 5280010
• The minimum spectral radius of signless Laplacian of graphs with a given clique number

Cites work

• scientific article; zbMATH DE number 5280010 (Why is no real title available?)
• An introduction to the theory of graph spectra
• Developments on spectral characterizations of graphs
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• Some Inequalities for the Largest Eigenvalue of a Graph
• Some graphs determined by their (signless) Laplacian spectra
• Some graphs determined by their spectra
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Spectral characterizations of almost complete graphs
• Spectral characterizations of lollipop graphs
• The complement of the path is determined by its spectrum
• The lollipop graph is determined by its spectrum
• The multi-fan graphs are determined by their Laplacian spectra
• The spectral characterization of \(\infty\)-graphs
• Which graphs are determined by their spectrum?

Cited in

(9)

• A Lagrange series approach to the spectrum of the kite
• Spectral properties of \(KK^j_n\) graphs
• A special class of triple starlike trees characterized by Laplacian spectrum
• The kite graph is determined by its adjacency spectrum
• On the Geršgorin disks of distance matrices of graphs
• Laplacian spectral characterization of (broken) dandelion graphs
• \(\mathrm{Kite}_{p+2,p}\) is determined by its Laplacian spectrum
• Spectral fundamentals and characterizations of signed directed graphs
• Kite graphs determined by their spectra

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

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