Maximizing the Index of Trees with Given Domination Number The index of a graph $G$ is the maximum eigenvalue of its adjacency matrix $A(G)$. In this paper we characterize the extremal tree with given domination number that attains the maximum index. Keywords:trees, spectral radius, index, domination numberCategory:05C50