On the maximum spectral radius of multipartite graphs

Let be an integer. A graph is called r – partite if V admits a partition into r parts such that every edge has its ends in different parts. All of the r – partite graphs with given integer r consis...