On the spectral characterization of kite graphs

zbMATH Open1425.05095arXiv1506.01632MaRDI QIDQ5241115FDOQ5241115

Authors: Sezer Sorgun, Hatice Topcu 

Publication date: 30 October 2019

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.

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

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

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)

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 (9)

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

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)