Investigation on spectrum of the adjacency matrix and Laplacian matrix of graph Gl

  • Authors:

  • Shuhua Yin

  • Affiliations:

  • Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, People's Republic Of China

  • Venue:
  • WSEAS TRANSACTIONS on SYSTEMS
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Let Gl be the graph obtained from Kl by adhering the root of isomorphic trees T to every vertex of Kl, and dk-j+1 be the degree of vertices in the level j. In this paper we study the spectrum of the adjacency matrix A(Gl) and the Laplacian matrix L(Gl) for all positive integer l, and give some results about the spectrum of the adjacency matrix A(Gl) and the Laplacian matrix L(Gl). By using these results, an upper bound for the largest eigenvalue of the adjacency matrix A(Gl) is obtained: λ1(A(Gl)) 2≤j≤k-2 max {√dj-1 + √dj+1-1}, √dk-1-1 + √dk-l + 1, √dk-l-1 + √dk-l+1+l-1}, and an upper bound for the largest eigenvalue of the Laplacian matrix L(Gl) is also obtained: µ1(L(Gl)) 2≤j≤k-2 max {√dj-1 + dj + √dj+1-1}, √dk-1-1 + dk-1 + √dk-l+1, √dk-l+1+dk+1}.