Abstract
In this paper, we first get the degree of each point in Lucas-sum graph based on Lucas numbers. After that, we obtain lower and upper bounds for the largest eigenvalues ? and µ of the adjacency matrices of Fibonacci-sum and Lucas-sum graphs, respectively.