On the spectral characterization of kite graphs
From MaRDI portal
Publication:5241115
zbMATH Open1425.05095arXiv1506.01632MaRDI QIDQ5241115FDOQ5241115
Publication date: 30 October 2019
Abstract: The extit{Kite graph}, denoted by is obtained by appending a complete graph to a pendant vertex of a path . In this paper, firstly we show that no two non-isomorphic kite graphs are cospectral w.r.t adjacency matrix. Let be a graph which is cospectral with and the clique number of is denoted by . Then, it is shown that . Also, we prove that graphs are determined by their adjacency spectrum.
Full work available at URL: https://arxiv.org/abs/1506.01632
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Cites Work
- Some Inequalities for the Largest Eigenvalue of a Graph
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- An introduction to the theory of graph spectra
- The lollipop graph is determined by its spectrum
- The complement of the path is determined by its spectrum
- Some graphs determined by their (signless) Laplacian spectra
- Spectral characterizations of almost complete graphs
- The spectral characterization of \(\infty\)-graphs
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spectral characterizations of lollipop graphs
- Some graphs determined by their spectra
- On a signless Laplacian spectral characterization of \(T\)-shape trees
- The multi-fan graphs are determined by their Laplacian spectra
- Title not available (Why is that?)
Cited In (8)
- $Kite_{p+2,p}$ is determined by its Laplacian spectrum
- Laplacian spectral characterization of (broken) dandelion graphs
- Kite graphs determined by their spectra
- Spectral properties of \(KK^j_n\) graphs
- Title not available (Why is that?)
- The kite graph is determined by its adjacency spectrum
- A special class of triple starlike trees characterized by Laplacian spectrum
- Spectral fundamentals and characterizations of signed directed graphs
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)