In the study of spectral graph theory,
there are various matrices that are associated with a graph,
such as the adjacency matrix, the Laplacian matrix,
signless Laplacian matrix and distance matrix.
One of the main problems of algebraic graph theory
is to determine the combinatorial properties of graphs that are reflected from
the algebraic properties of such matrices;
see [1]}, [2]}, [3]} for more details.
In this paper, we mainly focus on the
adjacency spectral radius and signless Laplacian spectral radius.
