On the spectral characterization of Kite graphs

zbMath1425.05095arXiv1506.01632MaRDI QIDQ5241115

Sezer Sorgun, Hatice Topcu

Publication date: 30 October 2019

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

zbMATH Keywords

clique numbercospectral graphskite graphdetermined by adjacency spectrum

Mathematics Subject Classification ID

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

Related Items (7)

$Kite_{p+2,p}$ is determined by its Laplacian spectrum ⋮ A special class of triple starlike trees characterized by Laplacian spectrum ⋮ Laplacian spectral characterization of (broken) dandelion graphs ⋮ Unnamed Item ⋮ Kite graphs determined by their spectra ⋮ Spectral fundamentals and characterizations of signed directed graphs ⋮ The kite graph is determined by its adjacency spectrum

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral characterizations of almost complete graphs
• The spectral characterization of \(\infty\)-graphs
• Some graphs determined by their spectra
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Spectral characterizations of lollipop graphs
• The multi-fan graphs are determined by their Laplacian spectra
• The lollipop graph is determined by its spectrum
• Developments on spectral characterizations of graphs
• Which graphs are determined by their spectrum?
• The complement of the path is determined by its spectrum
• Some graphs determined by their (signless) Laplacian spectra
• Some Inequalities for the Largest Eigenvalue of a Graph

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