On the spectral characterization of kite graphs
The \textit{Kite graph}, denoted by $Kite_{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 the adjacency matrix. Let $G$ be a graph which is cospectral with $Kit...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yildiz Technical University
2016-05-01
|
| Series: | Journal of Algebra Combinatorics Discrete Structures and Applications |
| Online Access: | http://dergipark.ulakbim.gov.tr/jacodesmath/article/view/5000184285 |
| id |
doaj-622a6073aa664195a650f316cc02b553 |
|---|---|
| record_format |
Article |
| spelling |
doaj-622a6073aa664195a650f316cc02b5532020-11-24T22:49:12ZengYildiz Technical UniversityJournal of Algebra Combinatorics Discrete Structures and Applications2148-838X2016-05-013210.13069/jacodesmath.017675000159321On the spectral characterization of kite graphsSezer SorgunHatice TopcuThe \textit{Kite graph}, denoted by $Kite_{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 the adjacency matrix. Let $G$ be a graph which is cospectral with $Kite_{p,q}$ and let $w(G)$ be the clique number of $G$. Then, it is shown that $w(G)\geq p-2q+1$. Also, we prove that $Kite_{p,2}$ graphs are determined by their adjacency spectrum.http://dergipark.ulakbim.gov.tr/jacodesmath/article/view/5000184285 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Sezer Sorgun Hatice Topcu |
| spellingShingle |
Sezer Sorgun Hatice Topcu On the spectral characterization of kite graphs Journal of Algebra Combinatorics Discrete Structures and Applications |
| author_facet |
Sezer Sorgun Hatice Topcu |
| author_sort |
Sezer Sorgun |
| title |
On the spectral characterization of kite graphs |
| title_short |
On the spectral characterization of kite graphs |
| title_full |
On the spectral characterization of kite graphs |
| title_fullStr |
On the spectral characterization of kite graphs |
| title_full_unstemmed |
On the spectral characterization of kite graphs |
| title_sort |
on the spectral characterization of kite graphs |
| publisher |
Yildiz Technical University |
| series |
Journal of Algebra Combinatorics Discrete Structures and Applications |
| issn |
2148-838X |
| publishDate |
2016-05-01 |
| description |
The \textit{Kite graph}, denoted by $Kite_{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 the adjacency matrix. Let $G$ be a graph which is cospectral with $Kite_{p,q}$ and let $w(G)$ be the clique number of $G$. Then, it is shown that $w(G)\geq p-2q+1$. Also, we prove that $Kite_{p,2}$ graphs are determined by their adjacency spectrum. |
| url |
http://dergipark.ulakbim.gov.tr/jacodesmath/article/view/5000184285 |
| work_keys_str_mv |
AT sezersorgun onthespectralcharacterizationofkitegraphs AT haticetopcu onthespectralcharacterizationofkitegraphs |
| _version_ |
1725676851574079488 |