ON THE LAPLACIAN EIGENVALUES OF THE KITE GRAPH
Öz
The kite graph is denoted by Kiten,n-p which is obtained by appending a complete graph Kp to a pendant vertex of the path graph Pn-p . In this paper, we present some spectral properties of Laplacian matrix of the kite graph. First we give the Laplacian characteristic polynomial of Kiten,n-p , then we restrict its largest Laplacian eigenvalue depending on the clique number. Also we say that any connected graph which has the same clique number with Kiten,n-p is isomorphic to the Kiten,n-p under some conditions.
Anahtar Kelimeler
Kaynakça
- KAYNAKLAR
- [1] Sorgun S. and Topcu H., On the spectral characterization of kite graphs, J. Algebra Comb. Discrete Struct. Appl. 2016; 3: 81-90.
- [2] Zhang X. and Zhang H.,Some graphs determined by their spectra, Linear Algebra and its Applications, 2009; 431 (9): 1443–1454.
- [3] Das K. C. and Liu M., Kite graphs determined by their spectra, Applied Mathematics and Computation, 2017; 297: 74–78.
- [4] Cvetkovic D., Rowlinson P. and Simic S., An introduction to the theory of graph spectra, Cambridge University Press, 2010.
- [5] Guo J. M., On the second largest Laplacian eigenvalue of trees, Linear Algebra and its Applications, 2005; 404 : 251–261.
- [6] Grone R., Merris R., The Laplacian spectrum of graph II, SIAM J. Discrete Math., 1994; 7: 221-229.
- [7] Godsil C., Royle G.,. Algebraic Graph Theory, Springer, 2001.
Ayrıntılar
Birincil Dil
Türkçe
Konular
-
Bölüm
Araştırma Makalesi
Yayımlanma Tarihi
30 Nisan 2018
Gönderilme Tarihi
23 Mayıs 2017
Kabul Tarihi
10 Kasım 2017
Yayımlandığı Sayı
Yıl 2018 Cilt: 6 Sayı: 1